5 December 2005 Comprehensive restoration performance analyzed under different routing and rerouting policies
Author Affiliations +
Proceedings Volume 6022, Network Architectures, Management, and Applications III; 60222B (2005) https://doi.org/10.1117/12.635095
Event: Asia-Pacific Optical Communications, 2005, Shanghai, China
Abstract
This paper studies the routing and wavelength assignment (RWA) problem in wavelength-routed all-optical networks with dynamic traffic demand. As well known, the performance of network restoration strongly depends upon the routing and rerouting policies. In this letter, we comprehensively analyzed the restoration performance under two main alternate dynamic routing algorithm, LLR(Least Loaded Routing) and FPLC(Fixed-Paths Least-Congestion routing), and two rerouting policies, based on K-path backup or Dijkstra algorithm. Through modelling and simulation, we compute the restoration efficiencies of four combinations on the NSFNET T1 backbone network, with different traffic load. The numerical simulation result shows that the rerouting policy based on Dijkstra algorithm has improved more 10%-20% performance than the rerouting policy based on K-path backup. The LLR and FPLC routing algorithm achieve the same performance by and large when the same rerouting policy is used.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bo Lei, Bo Lei, Peiyuan Lee, Peiyuan Lee, Wanyi Gu, Wanyi Gu, } "Comprehensive restoration performance analyzed under different routing and rerouting policies", Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60222B (5 December 2005); doi: 10.1117/12.635095; https://doi.org/10.1117/12.635095
PROCEEDINGS
9 PAGES


SHARE
Back to Top