Share Email Print
cover

Proceedings Paper

Path blocking probability analytical model and adaptive routing in wavelength-routed networks
Author(s): Peiyuan Lee; Yongtao Gong; WanYi Gu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper studies the routing and wavelength assignment (RWA) problem in wavelength-routed all-optical networks with dynamic traffic demand. In this letter, we model the link state transition as a birth and death process. With the proposed Markov model, the path blocking probability can be determined based on the current link state and the potential link load information, and then, we establish lightpath on the least congested route. The simulation result shows that compared with other adaptive routing algorithms, the proposed algorithm achieves much better blocking performance.

Paper Details

Date Published: 8 February 2005
PDF: 8 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.576942
Show Author Affiliations
Peiyuan Lee, Beijing Univ. of Posts and Telecommunications (China)
Yongtao Gong, Beijing Univ. of Posts and Telecommunications (China)
WanYi Gu, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top