Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection

Haitham S. Hamza, Jitender S. Deogun, Kefei Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we address the problem of routing and wavelength assignment (RWA) in path-protected WDM mesh networks with the objective of maximizing the sharing chances of wavelength links and optical-electronic-optical regenerators (OEOs) between demands, and hence, minimize the overall network resource needed. Both an integer liner program (ILP) solution and a Tabu search heuristic are proposed and their performance is experimentally evaluated through extensive simulation over different network topologies. Our simulation results confirm an average of 50 % reduction in the number of OEOs compared to that required with the well-known shared-path protection scheme in which only wavelength links are shared among different traffic demands.

Original languageEnglish (US)
Title of host publication2005 Workshop on High Performance Switching and Routing, HPSR 2005
Pages421-425
Number of pages5
StatePublished - 2005
Event2005 Workshop on High Performance Switching and Routing, HPSR 2005 - Hong Kong, China
Duration: May 12 2005May 14 2005

Publication series

Name2005 Workshop on High Performance Switching and Routing, HPSR 2005

Conference

Conference2005 Workshop on High Performance Switching and Routing, HPSR 2005
Country/TerritoryChina
CityHong Kong
Period5/12/055/14/05

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection'. Together they form a unique fingerprint.

Cite this