On Exploiting Sharable Resources With Resource Contention Resolution for Surviving Double-Link Failures in Optical Mesh Networks

2012 ◽  
Vol 30 (17) ◽  
pp. 2788-2795 ◽  
Author(s):  
Ning-Hai Bao ◽  
Le-Min Li ◽  
Hong-Bin Luo ◽  
Zhi-Zhong Zhang ◽  
Hong-Fang Yu
Keyword(s):  
Mesh Networks ◽  
Contention Resolution ◽  
Resource Contention ◽  
Link Failures ◽  
Optical Mesh Networks

scholarly journals Pre-configured polyhedron based protection against multi-link failures in optical mesh networks

2014 ◽  
Vol 22 (3) ◽  
pp. 2386 ◽  
Author(s):  
Shanguo Huang ◽  
Bingli Guo ◽  
Xin Li ◽  
Jie Zhang ◽  
Yongli Zhao ◽  
...  
Keyword(s):  
Mesh Networks ◽  
Link Failures ◽  
Optical Mesh Networks

Loopback Recovery From Double-Link Failures in Optical Mesh Networks

2004 ◽  
Vol 12 (6) ◽  
pp. 1119-1130 ◽  
Author(s):  
H. Choi ◽  
S. Subramaniam ◽  
H.-A. Choi
Keyword(s):  
Mesh Networks ◽  
Link Failures ◽  
Optical Mesh Networks

Multi-hop traffic grooming routing and wavelength assignment using split light trail in WDM all optical mesh networks

2021 ◽  
pp. 1-14
Author(s):  
Sampa Rani Bhadra ◽  
Ashok Kumar Pradhan ◽  
Utpal Biswas
Keyword(s):  
Mesh Networks ◽  
Blocking Probability ◽  
Wavelength Assignment ◽  
End User ◽  
Network Resources ◽  
Wdm Network ◽  
Optical Wdm ◽  
All Optical ◽  
User Access ◽  
Optical Mesh Networks

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.

Sign in / Sign up

Export Citation Format

Share Document