Share Email Print
cover

Proceedings Paper

Comprehensive restoration performance analyzed under different routing and rerouting policies
Author(s): Bo Lei; Peiyuan Lee; 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. 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.

Paper Details

Date Published: 6 December 2005
PDF: 9 pages
Proc. SPIE 6022, Network Architectures, Management, and Applications III, 60222B (6 December 2005); doi: 10.1117/12.635095
Show Author Affiliations
Bo Lei, Beijing Univ. of Posts and Telecommunications (China)
Peiyuan Lee, Beijing Univ. of Posts and Telecommunications (China)
Wanyi Gu, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 6022:
Network Architectures, Management, and Applications III
Kwok-wai Cheung; Gee-Kung Chang; Guangcheng Li; Ken-Ichi Sato, Editor(s)

© SPIE. Terms of Use
Back to Top