Paper
19 November 2007 Multi-class service based on the adaptive routing algorithm in WDM networks
Zichun Le, Zhijun Zhu, Ran Zhu, Minglei Fu
Author Affiliations +
Proceedings Volume 6783, Optical Transmission, Switching, and Subsystems V; 67833R (2007) https://doi.org/10.1117/12.742680
Event: Asia-Pacific Optical Communications, 2007, Wuhan, China
Abstract
It is important to analyse blocking probability in the WDM networks. In this paper, we present an analytical model for supporting multi-class service with the blocking probability analysis and adaptive routing algorithm to solve the potential shortcomings in the real network. We make the use of the idea of segmented routes according to the finite wavelength conversion resources. We then combine the each segment to get the whole blocking probability. The results show that, by adopting the adaptive routing algorithms, the network can calculate the blocking probability for all the candidate routes, and the request which takes the highest priority will choose the minimum blocking probability route. There are two features in our paper. First, a method of segmented route is designed. Second, use k-shortest routing algorithm to get the minimum blocking probability routing between source node and destination node.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zichun Le, Zhijun Zhu, Ran Zhu, and Minglei Fu "Multi-class service based on the adaptive routing algorithm in WDM networks", Proc. SPIE 6783, Optical Transmission, Switching, and Subsystems V, 67833R (19 November 2007); https://doi.org/10.1117/12.742680
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelength division multiplexing networks

Computer simulations

Optical networks

Wavelength division multiplexing

Surface plasmons

Tin

Switching

Back to Top