Computing approximate blocking probability of inverse multiplexing and sub-band conversion in the flexible-grid optical networks

2016 ◽  
Vol 371 ◽  
pp. 243-247 ◽  
Author(s):  
Yamei Gu ◽  
Shanhong You
2021 ◽  
Author(s):  
Varsha Lohani

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.


2021 ◽  
Author(s):  
Varsha Lohani

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.


Photonics ◽  
2021 ◽  
Vol 8 (10) ◽  
pp. 456
Author(s):  
Shengyu Zhang ◽  
Kwan Lawrence Yeung ◽  
Along Jin

We consider a space-division multiplexing elastic optical network (SDM-EON) that supports super-channels (SChs). A Sch comprises a set of contiguous frequency slots on multiple cores in a multi-core fiber. The problem of finding a lightpath using SChs involves routing, modulation, spectrum and core assignment (RMSCA). To minimize the request blocking probability (RBP), two critical issues must be addressed. First, routing and modulation assignment (RMA) should not cause hotspots, or overutilized links. Second, spectrum and core assignment (SCA) should aim at minimizing fragmentation, or small frequency slot blocks that can hardly be utilized by future requests. In this paper, a pre-computation method is first proposed for better load balancing in RMA. Then an efficient fragmentation-aware SCA is proposed based on a new fragmentation metric that measures both the spectral and spatial fragmentation. With the enhanced RMA and SCA, a joint load-balanced and fragmentation-aware algorithm called LBFA is designed to solve the RMSCA problem. As compared with the existing algorithms, simulation results show that our LBFA provides significant reduction in RBP.


2013 ◽  
Vol 9 (2) ◽  
pp. 1055-1062
Author(s):  
Ifrah Amin ◽  
Gulzar Ahmad dar ◽  
Hrdeep singh Saini

Routing and wavelength assignment problem is one of the main problem in optical networks. The foremost problem is the routing problem after which the wavelength assignment is to be decided. In this paper we have proposed a routing strategy for optimization of the performance of the optical network in terms of blocking probability. The strategy proposed is better than the conventional algorithm in terms of blocking. 


2013 ◽  
Vol 49 (5) ◽  
pp. 359-361 ◽  
Author(s):  
R.C. Almeida ◽  
A.F. Santos ◽  
K.D.R. Assis ◽  
H. Waldman ◽  
J.F. Martins‐Filho

2021 ◽  
Author(s):  
Xiaosong Yu ◽  
Lu Lu ◽  
Yongli Zhao ◽  
Jie Zhang

2014 ◽  
Vol 12 (7) ◽  
pp. 070601-70606 ◽  
Author(s):  
Yongli Zhao Yongli Zhao ◽  
Jie Zhang Jie Zhang

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Sridhar Iyer

AbstractIn this article, we focus on the optimization of lightpath routing in an online Space Division Multiplexing-based Elastic Optical Network (SDM-b-EON) which is protected by the dedicated route protection (DRP) strategy. In view of the aforementioned, the Online Protection and Routing Algorithm with Regeneration (OPaRAwR) method is proposed which (i) protects the lightpaths through DRP, (ii) accounts for the presence of transceivers in the network, and (iii) ensures the routing of translucent lightpaths through the spectral super-channels over the spatial modes links. In regard to regeneration, we investigate two scenarios which differ in their regeneration variability level in addition to the adjustment of modulation formats (MFs) as per the transmission route characteristics. Extensive simulation experiments are conducted considering realistic transmission reach values and two realistic network topologies. The obtained simulation results demonstrate that the proposed OPaRAwR method significantly outperforms various reference techniques in terms of bandwidth blocking probability (BwBP). In addition, the results also show that significant benefits can be obtained in regard to the utilization of resources (spectrum and transceivers) with much lesser BwBP when the regeneration is conducted with complete flexibility and MF conversion is also permitted at every node of the SDM-b-EON.


2009 ◽  
Vol 3 (11) ◽  
pp. 1716 ◽  
Author(s):  
Y. Zhao ◽  
J. Zhang ◽  
D. Han ◽  
X. Zhang ◽  
Y. Yao ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document