8 February 2005 Path blocking probability analytical model and adaptive routing in wavelength-routed networks
Author Affiliations +
Proceedings Volume 5626, Network Architectures, Management, and Applications II; (2005); doi: 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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Peiyuan Lee, Yongtao Gong, 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); doi: 10.1117/12.576942; https://doi.org/10.1117/12.576942
PROCEEDINGS
8 PAGES


SHARE
KEYWORDS
Autoregressive models

Networks

Computer simulations

Network architectures

Optical networks

Wavelength division multiplexing

Atrial fibrillation

RELATED CONTENT


Back to Top