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

Xiaoning Zhang; Lemin Li

doi:10.1117/1.2338549

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

Xiaoning Zhang, Lemin Li

Author Affiliations +

Optical Engineering, Vol. 45, Issue 8, 085003 (August 2006). https://doi.org/10.1117/1.2338549

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.

©(2006) Society of Photo-Optical Instrumentation Engineers (SPIE)

Citation Download Citation

Xiaoning Zhang and Lemin Li "Robust routing algorithms based on Valiant load balancing for wavelength-division-multiplexing mesh networks," Optical Engineering 45(8), 085003 (1 August 2006). https://doi.org/10.1117/1.2338549

Published: 1 August 2006

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available