Multicast Routing and Spectrum Assignment in Flexible-Grid Optical Networks Based on Light-Tree Sharing Approach

2016 ◽  
Author(s):  
Panchali Datta Choudhury ◽  
Ritesh Singh Chauhan ◽  
P. V. Sudheer ◽  
Tanmay De
Keyword(s):  
Optical Networks ◽  
Multicast Routing ◽  
Spectrum Assignment ◽  
Routing And Spectrum Assignment ◽  
Flexible Grid

scholarly journals Dynamic Routing and Spectrum Assignment based on the Availability of Consecutive Sub-channels in Flexible-grid Optical Networks

2021 ◽  
Author(s):  
Varsha Lohani
Keyword(s):  
Optical Networks ◽  
Orthogonal Frequency Division Multiplexing ◽  
Blocking Probability ◽  
Frequency Division ◽  
Recent Past ◽  
Spectrum Assignment ◽  
Rsa Algorithm ◽  
Adaptive Parameters ◽  
Routing And Spectrum Assignment ◽  
Flexible Grid

Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient use of spectrum by allocating integral multiple of basic bandwidth slot to the lightpath requests. In these networks, the constraint of keeping all the allocated slots together is added when deciding the routes for the requests. This constraint is called the contiguity constraint, which makes the routing and spectrum arrangement algorithms more challenging. In any network, the lightpath requests will arrive and depart dynamically and invariably lead to spectrum fragmentation. Hence network will have to reduce the maximum possible utilization as well as increased blocking probability. In this paper, we have presented an improvised Routing and Spectrum Assignment (RSA) algorithm using consecutive spectrum slots that leads to lesser fragmentation. It is evident from the results that the presented RSA algorithm uses adaptive parameters to reduce the blocking probability and fragmentation compared to the other algorithms reported in the recent past.

scholarly journals Brown-Field Migration Aware Routing and Spectrum Assignment in Backbone Optical Networks

2022 ◽  
Vol 12 (1) ◽  
pp. 438
Author(s):  
Xiaosong Yu ◽  
Jiye Wang ◽  
Kaixin Zhang ◽  
Jiaqi Lv ◽  
Yongli Zhao ◽  
...  
Keyword(s):  
Optical Networks ◽  
Service Provisioning ◽  
Shortest Path Routing ◽  
Spectrum Assignment ◽  
Fine Grained ◽  
Rsa Algorithm ◽  
Assignment Algorithm ◽  
Routing And Spectrum Assignment ◽  
Field Deployment ◽  
Flexible Grid

With the development of optical networks technology, broad attention has been paid to flexible grid technology in optical networks due to its ability to carry large-capacity information as well as provide flexible and fine-grained services through on-demand spectrum resource allocation. However, a one-time green-field deployment of a flexible grid network may not be practical. The transition technology called the fixed/flex-grid optical networks is more applicable and highly pragmatic. In such network, many nodes would likely be upgraded from a fixed-grid to flex-grid. In fact, dynamic service provisioning during the process of a node upgrade in fixed/flex-grid optical networks have become a challenge because the service connection can be easily interrupted, which leads to considerable data loss because of node upgrade. To overcome this challenge, we propose a brown-field migration aware routing and spectrum assignment (BMA-RSA) algorithm in fixed/flex-grid optical networks. The aim is to construct a probabilistic migration label (PML) model. The well-designed label setting of PML can balance the relationship between distance and node-upgrade probability. Dynamic service provisioning operations are undertaken based on the PML model to achieve a migration-aware dynamic connection before network migration occurs. We also evaluate the performance of different service provisioning strategies under different traffic models. The simulation results show that the BMA-RSA algorithm can achieve: (1) the tradeoff between distance and node upgrade probability during the process of service provisioning; (2) lower service interruption compared with the traditional non-migration aware K-shortest-path routing and spectrum assignment algorithm.

scholarly journals Dynamic Routing and Spectrum Assignment based on the Availability of Consecutive Sub-channels in Flexible-grid Optical Networks

2021 ◽  
Author(s):  
Varsha Lohani
Keyword(s):  
Optical Networks ◽  
Orthogonal Frequency Division Multiplexing ◽  
Blocking Probability ◽  
Frequency Division ◽  
Recent Past ◽  
Spectrum Assignment ◽  
Rsa Algorithm ◽  
Adaptive Parameters ◽  
Routing And Spectrum Assignment ◽  
Flexible Grid

Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient use of spectrum by allocating integral multiple of basic bandwidth slot to the lightpath requests. In these networks, the constraint of keeping all the allocated slots together is added when deciding the routes for the requests. This constraint is called the contiguity constraint, which makes the routing and spectrum arrangement algorithms more challenging. In any network, the lightpath requests will arrive and depart dynamically and invariably lead to spectrum fragmentation. Hence network will have to reduce the maximum possible utilization as well as increased blocking probability. In this paper, we have presented an improvised Routing and Spectrum Assignment (RSA) algorithm using consecutive spectrum slots that leads to lesser fragmentation. It is evident from the results that the presented RSA algorithm uses adaptive parameters to reduce the blocking probability and fragmentation compared to the other algorithms reported in the recent past.

Routing and spectrum assignment: A metaheuristic for hybrid ordering selection in elastic optical networks

2021 ◽  
pp. 108287
Author(s):  
Henrique A. Dinarte ◽  
Bruno V.A. Correia ◽  
Daniel A.R. Chaves ◽  
Raul C. Almeida
Keyword(s):  
Optical Networks ◽  
Spectrum Assignment ◽  
Routing And Spectrum Assignment
Sign in / Sign up

Export Citation Format

Share Document