3 October 2006 Valiant load-balanced robust routing algorithm for multigranularity connection requests in traffic-grooming WDM mesh networks
Author Affiliations +
Proceedings Volume 6353, Optical Transmission, Switching, and Subsystems IV; 635342 (2006) https://doi.org/10.1117/12.691026
Event: Asia-Pacific Optical Communications, 2006, Gwangju, South Korea
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaoning Zhang, Xiaoning Zhang, Lemin Li, Lemin Li, Sheng Wang, Sheng Wang, } "Valiant load-balanced robust routing algorithm for multigranularity connection requests in traffic-grooming WDM mesh networks", Proc. SPIE 6353, Optical Transmission, Switching, and Subsystems IV, 635342 (3 October 2006); doi: 10.1117/12.691026; https://doi.org/10.1117/12.691026
PROCEEDINGS
11 PAGES


SHARE
Back to Top