Path blocking probability analytical model and adaptive routing in wavelength-routed networks

Peiyuan Lee; Yongtao Gong; WanYi Gu

doi:10.1117/12.576942

8 February 2005 Path blocking probability analytical model and adaptive routing in wavelength-routed networks

Peiyuan Lee, Yongtao Gong, WanYi Gu

Proceedings Volume 5626, Network Architectures, Management, and Applications II; (2005) https://doi.org/10.1117/12.576942
Event: Asia-Pacific Optical Communications, 2004, Beijing, China

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.

Citation Download Citation

Peiyuan Lee, Yongtao Gong, and WanYi Gu "Path blocking probability analytical model and adaptive routing in wavelength-routed networks", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); https://doi.org/10.1117/12.576942

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available