Paper
3 October 2006 Valiant load-balanced robust routing under hose model for WDM mesh networks
Xiaoning Zhang, Lemin Li, Sheng Wang
Author Affiliations +
Proceedings Volume 6353, Optical Transmission, Switching, and Subsystems IV; 63533C (2006) https://doi.org/10.1117/12.687538
Event: Asia-Pacific Optical Communications, 2006, Gwangju, South Korea
Abstract
In this paper, we propose Valiant Load-Balanced robust routing scheme for WDM mesh networks under the model of polyhedral uncertainty (i.e., hose model), and the proposed routing scheme is implemented with traffic grooming approach. Our Objective is to maximize the hose model throughput. A mathematic formulation of Valiant Load-Balanced robust routing is presented and three fast heuristic algorithms are also proposed. When implementing Valiant Load-Balanced robust routing scheme to WDM mesh networks, a novel traffic-grooming algorithm called MHF (minimizing hop first) is proposed. We compare the three heuristic algorithms with the VPN tree under the hose model. Finally we demonstrate in the simulation results that MHF with Valiant Load-Balanced robust routing scheme outperforms the traditional traffic-grooming algorithm in terms of the throughput for the uniform/non-uniform traffic matrix under the hose model.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaoning Zhang, Lemin Li, and Sheng Wang "Valiant load-balanced robust routing under hose model for WDM mesh networks", Proc. SPIE 6353, Optical Transmission, Switching, and Subsystems IV, 63533C (3 October 2006); https://doi.org/10.1117/12.687538
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelength division multiplexing

Mathematical modeling

Computer simulations

Curium

Mathematics

Matrices

Optical networks

Back to Top