Robust routing algorithms based on Valiant load balancing for wavelength-division-multiplexing mesh networks

Abstract

In wavelength-division-multiplexing (WDM) mesh networks, previous routing algorithms are commonly used under the specific future traffic demand; however, it is difficult to predict the future traffic demand accurately in a practical sense. We propose a novel robust routing scheme based on Valiant load balancing in WDM mesh networks for the model of polyhedral uncertainty (i.e., hose model) and apply the scheme to low-speed connections with a traffic grooming approach. Our objective is to minimize total network cost. A mathematic formulation of the Valiant load-balancing robust routing scheme is presented and two fast heuristics are also proposed. When implementing the robust routing scheme to WDM mesh networks, a new traffic grooming algorithm called MHF (minimizing hop first) is proposed. We evaluate the MHF with the Valiant load-balancing robust routing scheme compared with traditional traffic-grooming algorithms.