Share Email Print

Proceedings Paper

Multi-class service based on the adaptive routing algorithm in WDM networks
Author(s): Zichun Le; Zhijun Zhu; Ran Zhu; Minglei Fu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 19 November 2007
PDF: 8 pages
Proc. SPIE 6783, Optical Transmission, Switching, and Subsystems V, 67833R (19 November 2007); doi: 10.1117/12.742680
Show Author Affiliations
Zichun Le, Zhejiang Univ. of Technology (China)
Zhijun Zhu, Zhejiang Univ. of Technology (China)
Ran Zhu, Zhejiang Univ. of Technology (China)
Minglei Fu, Zhejiang Univ. of Technology (China)

Published in SPIE Proceedings Vol. 6783:
Optical Transmission, Switching, and Subsystems V
Dominique Chiaroni; Wanyi Gu; Ken-ichi Kitayama; Chang-Soo Park, Editor(s)

© SPIE. Terms of Use
Back to Top