Hybrid Policy of Routing and Spectrum Assignment in Elastic Optical Networks

The major challenge in elastic optical networks is to determine the path of a connection and to allocate spectral resources on the links of this path. This problem consists of two sub-problems, routing and spectrum allocation. In the literature, these sub-problems are solved with a predefined order for all topology node pairs. Recent work proposes hybrid resolution algorithms based on connection demand and network state to provide a solution to these problems. However, the blocking rate of new connection requests has become problematic. In this work, we propose a hybrid routing and spectrum assignment policy to improve blocking rate of new connection requests. The proposed solution consists to change the routing policy of a pair node if the connection request is blocked. This algorithm improves the blocking rate of new connection requests.

Anycast Transmission in Routing Modulation Level Spectrum Assignment (RMLSA) Problem on Space Division Multiplexing (SDM) Elastic Optical Networks (EON)

With the rise of cloud computing in recent years, a large number of streaming media has yielded an exponential growth in network traffic. With the now present 5G and future 6G, the development of the Internet of Things (IoT), social networks, video on demand, and mobile multimedia platforms, the backbone network is bound to bear more traffic. The transmission capacity of Single Core Fiber (SCFs) may be limited in the future and Spatial Division Multiplexing (SDM) leveraging multi-core fibers promises to be one of the solutions for the future. Currently, Elastic optical networks (EONs) with multi-core fibers (MCFs) are a kind of SDM-enabled EONs (SDM-EON) used to enhance the capacity of transmission. The resource assignment in MCFs, however, will be subject to Inter-Core Crosstalk (IC-XT), hence, reducing the effectiveness of transmission. This research highlights the routing, modulation level, and spectrum assignment (RMLSA) problems with anycast traffic mode in SDM-EON. A multipath routing scheme is used to reduce the blocking rate of anycast traffic in SDM-EON with the limit of inter-core crosstalk. Hence, an integer linear programming (ILP) problem is formulated and a heuristic algorithm is proposed. Two core-assignment strategies: First-Fit (FF) and Random-Fit (RF) are used and their performance is evaluated through simulations. The simulation results show that the multipath routing method is better than the single-path routing method in terms of blocking ratio and spectrum utilization ratio. Moreover, the FF is better than the RF in low traffic load in terms of blocking ratio (BR), and the opposite in high traffic load. The FF is better than the RF in terms of a spectrum utilization ratio. In an anycast protection problem, the proposed algorithm has a lower BR than previous works.

PCE-based routing and spectrum assignment in OFDM-based bandwidth-variable optical networks

Bandwidth-variable optical networks can not only provide bandwidth-flexible lightpaths, but also complete high capacity all-optical switching, and improve the spectrum efficiency. However, for the spectrum assignment in orthogonal frequency-division multiplexing （OFDM）-based bandwidth-variable optical networks, a lot of sub-carrier resources will be overlapped during the process of reservation with distributed signaling, whether for the first fit （FF） algorithm or for the random fit （RF） algorithm, In order to solve the issue of resource reservation collision, we propose two path computation element （PCE）-based spectrum assignment algorithms and two corresponding optimization algorithms. But, even for PCE-based spectrum assignment, a lot of fragments of sub-carrier resources will be generated during the process of resource reservation, and service LSP establishment and teardown, which will deteriorate the performance of the entire network seriously. This paper proposes a PCE-based defragmentation algorithm for sub-carriers spectrum resource in OFDM-based bandwidth-variable optical networks, the simulation results of which show that this algorithm can reduce sub-carriers fragments considerably and improve the continuity of spectrum resource.

Electronic structure and photoelectron spectrum Assignment of allene

In this paper a series of ab initio SCF and configuration calculations were reported for the ground state and excited states X^2E, A^2E,~2B_2 and ~2A_1 of allene.For ground state X^2E Jahn- Teller distorsion was discussed and a twisted angle of 50° and a torsional barriers of 0.21—0.51 eV were derived.Based on calculated results,the experimental photoelectron spectrum of allene has been assigned.

Study on Band Structure of YbB_6 and Analysis of Its Optical Conductivity Spectrum

The electronic structure of YbB6 crystal was studied by means of density functional （GGA ＋ U） method. The calculations were performed by FLAPW method. The high accurate band structure was achieved. The correlation between the feature of the band structure and the Yb-B6 bonding in YbB6 was analyzed. On this basis, some optical constants of YbB6 such as reflectivity, dielectric function, optical conductivity, and energy-loss function were calculated. The results are in good agreement with the experiments. The real part of the optical conductivity spectrum and the energy-loss function spectrum were analyzed in detail. The assignments of the spectra were carried out to correlate the spectral peaks with the interband electronic transitions, which justify the reasonable part of previous empirical assignments and renew the missed or incorrect ones.

Suboptimal stochastic H-two/H-infinity design with spectrum constraint

This paper studies the problem of suboptimal state-feedback H-two/H-infinity control of stochastic systems with spectrum constraint. Concretely speaking, a mixed suboptimal H-two/H-infinity controller synthesis together with placing the spectrum into a strip region is considered, which is achieved via solving a convex optimization problem.

Proactive Connection Recovery Strategy with Recovery Time Constraint for Survivable Elastic Optical Networks

This paper presents a halfway signaling exchange shared path protection(HSE-SPP)on the backup route for a fast connection recovery strategy.In the proposed HSE-SPP,a pre-assigned intermediate node on the backup route is chosen for signaling exchange.When connection fails,source and destination nodes simultaneously generate backup connection setup messages to the pre-assigned intermediate node on the reserved backup route.At the intermediate node,signaling process occurs,and acknowledgment is generated for data transmission to the respective end nodes.Consequently,connection recovery time by applying HSE-SPP becomes very low.Simulations are performed for network parameters and results are verified with existing strategies.The average recovery time(RT),bandwidth blocking probability(BBP),bandwidth provisioning ratio(BPR),and resource overbuild(RO)ratio of HSE-SPP for ARPANET is 13.54 ms,0.18,3.02,0.55,and for dedicated path protection(DPP)are 13.20 ms,0.56,6.30,3.75 and for shared path protection(SPP)22.19 ms,0.22,3.23,0.70 respectively.Similarly,average RT,BBP,BPR and RO of HSE-SPP for COST239 are8.33 ms,0.04,1.64,0.26,and for DPP 4.23,0.47,3.50,2.04,and for SPP 11.81,0.08,1.66,0.27 respectively.Hence,results of the proposed strategy are better in terms of RT,BBP,BPR,and RO ratio.

Cost-Minimized Virtual Elastic Optical Network Provisioning with Guaranteed QoS

Network virtualization is important for elastic optical networks(EONs)because of more flexible service provisioning.To ensure guaranteed quality of service(QoS)for each virtual elastic optical network(VEON),clients usually request network resources from a network operator based on their bandwidth requirements predicted from historical traffic demands.However,this may not be efficient as the actual traffic demands of users always fluctuate.To tackle this,we propose a new VEON service provisioning scheme,called SATP,which consists of three stages,i.e.,spectrum assignment(SA),spectrum trading(ST),and spectrum purchasing(SP).Unlike conventional once-for-all VEON service provisioning approaches,the SATP scheme first allocates spectrum resources to VEONs according to their predicted bandwidth requirements with a satisfaction ratio α(0<α≤1).Then,to minimize service degradation on VEONs which are short of assigned spectra for their peak traffic periods,the scheme allows VEONs to trade spectra with each other according to their actual bandwidth requirements.Finally,it allows VEON clients to purchase extra spectrum resources from a network operator if the spectrum resources are still insufficient.To optimize this entire process,we formulate the problem as a mixed integer linear programming(MILP)model and also develop efficient heuristic algorithms for each stage to handle large test scenarios.Simulations are conducted under different test conditions for both static and dynamic traffic demand scenarios.Results show that the proposed SATP scheme is efficient and can achieve significant performance improvement under both static and dynamic scenarios.