Survivable traffic grooming in WDM mesh networks under SRLG constraints

W. Yao, Byrav Ramamurthy
May 2005
Cite DOI URL

Abstract

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multi-granularity connection services in optical networks. In this paper, we study the static STG problem in WDM mesh networks employing path protection at the lightpath level. To make connections survivable under various failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. In addition to providing the results from the integer linear programming (ILP) approach, we propose three efficient heuristics, namely separated grooming algorithm (SGA), integrated grooming algorithm (IGA) and tabu search grooming algorithm (TSGA). While SGA and IGA correspond to an overlay model and a peer model respectively, TSGA further improves SGA and IGA by incorporating the tabu search method. Numerical results show that the heuristics use much shorter running times to generate network throughputs close to those of the ILP formulations.

Type
Conference paper
Publication
IEEE International Conference on Communications, 2005. ICC 2005. 2005
Telecommunication Traffic Wavelength Division Multiplexing WDM Networks Optical Fiber Networks Protection Integer Programming Linear Programming Search Problems Mesh Networks Routing Integer Linear Programming Telecommunication Network Reliability Risk Analysis Ducts
Byrav Ramamurthy
Byrav Ramamurthy
Professor & PI

My research areas include optical and wireless networks, peer-to-peer networks for multimedia streaming, network security and telecommunications. My research work is supported by the U.S. National Science Foundation, U.S. Department of Energy, U.S. Department of Agriculture, NASA, AT&T Corporation, Agilent Tech., Ciena, HP and OPNET Inc.