A Novel Shared Protection Scheme Based on Aggregate Wavelength in High Speed Networks

We propose novel analytical model of dynamic link cost evaluation in IP over WDM networks. We suggest disjoint path algorithm for the primary and backup path based on wavelength aggregate information, to provide shared backup. We show the optimality of pair selected because of joint optimization of the pair paths. The shareable capacity factor is introduced to establish the effect of load balancing on resources. We compared our simulation results with that of separate protection at connection and showed improvement on resource utilization performance of the network. We also study the blocking probability of proposed scheme.

Download Full-text

Shared protection mechanisms in IP-over-WDM networks

10.1117/12.445170 ◽

2001 ◽

Author(s):

Yinghua Ye ◽

Chadi M. Assi ◽

Sudhir Dixit ◽

Mohamed A. Ali

Keyword(s):

Wdm Networks ◽

Ip Over Wdm ◽

Shared Protection ◽

Protection Mechanisms

Download Full-text

A simple dynamic integrated provisioning/protection scheme in IP over WDM networks

IEEE Communications Magazine ◽

10.1109/35.965377 ◽

2001 ◽

Vol 39 (11) ◽

pp. 174-182 ◽

Cited By ~ 33

Author(s):

Yinghua Ye ◽

C. Assi ◽

S. Dixit ◽

M.A. Ali

Keyword(s):

Wdm Networks ◽

Ip Over Wdm ◽

Protection Scheme

Download Full-text

Optimal and Computationally Efficient Priority-Based Routing and Wavelength Allocation Strategy Supporting Qos for High-Speed Transport Networks

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.b1191.0882s819 ◽

2019 ◽

Vol 8 (2S8) ◽

pp. 1000-1003

Keyword(s):

High Speed ◽

Blocking Probability ◽

Optical Network ◽

Setup Time ◽

Wdm Networks ◽

Traffic Load ◽

Computationally Efficient ◽

Information Transparency ◽

Wavelength Reuse ◽

Priority Criterion

One of major optical network problem is to route and to assign the wavelength efficiently because of its wavelength reuse characteristics and information transparency. By utilizing the trade-off scheme between the blocking probability and setup time of the requested route, priority-based RWA (PRWA) approaches has been studied for WDM networks by introducing a priority criterion which depends on calculation of hop counts and volume of the traffic. The simulation result shows that PRWA technique reduces both the blocking probability (approx. 20%) as compare with non-priority based RWA scheme and the average end to end delay near about (10 msec.) as compare with Adaptive routing (AR) at various traffic load conditions. This approach also results in cost-effectiveness as well as reduction in the complexity of the network in comparison to earlier reported techniques

Download Full-text