Share Email Print
cover

Proceedings Paper

Valiant load-balanced robust routing algorithm for multigranularity connection requests in traffic-grooming WDM mesh networks
Author(s): Xiaoning Zhang; Lemin Li; Sheng Wang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The paper considers the problem of establishing robust routes for multi-granularity connection requests in traffic-grooming WDM mesh networks and proposes a novel Valiant Load-Balanced robust routing scheme for the hose uncertain model. Our objective is to minimize the total network cost when assuring robust routing for all possible multi-granularity connection requests under the hose model. Since the optimization problem is recently shown to be NP-hard, two heuristic algorithms are proposed and compared. When implementing Valiant Load-Balanced robust routing scheme to WDM mesh networks, a novel traffic-grooming algorithm called MHF (minimal hop first) is proposed. We evaluate MHF by Valiant Load-Balanced robust routing with the traditional traffic-grooming algorithm by computer simulation.

Paper Details

Date Published: 3 October 2006
PDF: 11 pages
Proc. SPIE 6353, Optical Transmission, Switching, and Subsystems IV, 635342 (3 October 2006); doi: 10.1117/12.691026
Show Author Affiliations
Xiaoning Zhang, Univ. of Electronic Science and Technology of China (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)
Sheng Wang, Univ. of Electronic Science and Technology of China (China)


Published in SPIE Proceedings Vol. 6353:
Optical Transmission, Switching, and Subsystems IV
Chang Soo Park; Shizhong Xie; Curtis R. Menyuk; Ken-ichi Kitayama, Editor(s)

© SPIE. Terms of Use
Back to Top