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 - Nov 15 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
CountryChina
CityHong Kong
Period5/12/055/14/05

Fingerprint

Wavelength division multiplexing
Regenerators
Wavelength
Tabu search
Topology

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hamza, H. S., Deogun, J. S., & Wang, K. (2005). Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection. In 2005 Workshop on High Performance Switching and Routing, HPSR 2005 (pp. 421-425). (2005 Workshop on High Performance Switching and Routing, HPSR 2005).

Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection. / Hamza, Haitham S.; Deogun, Jitender S; Wang, Kefei.

2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. p. 421-425 (2005 Workshop on High Performance Switching and Routing, HPSR 2005).

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

Hamza, HS, Deogun, JS & Wang, K 2005, Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection. in 2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005 Workshop on High Performance Switching and Routing, HPSR 2005, pp. 421-425, 2005 Workshop on High Performance Switching and Routing, HPSR 2005, Hong Kong, China, 5/12/05.
Hamza HS, Deogun JS, Wang K. Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection. In 2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. p. 421-425. (2005 Workshop on High Performance Switching and Routing, HPSR 2005).
Hamza, Haitham S. ; Deogun, Jitender S ; Wang, Kefei. / Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection. 2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. pp. 421-425 (2005 Workshop on High Performance Switching and Routing, HPSR 2005).
@inproceedings{828ea347821c4157860531322f6aced2,
title = "Routing and wavelength assignment with maximum resource sharing in WDM mesh networks with path-based protection",
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.",
author = "Hamza, {Haitham S.} and Deogun, {Jitender S} and Kefei Wang",
year = "2005",
month = "11",
day = "15",
language = "English (US)",
isbn = "0780389247",
series = "2005 Workshop on High Performance Switching and Routing, HPSR 2005",
pages = "421--425",
booktitle = "2005 Workshop on High Performance Switching and Routing, HPSR 2005",

}

TY - GEN

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

AU - Hamza, Haitham S.

AU - Deogun, Jitender S

AU - Wang, Kefei

PY - 2005/11/15

Y1 - 2005/11/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=27644571871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27644571871&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0780389247

SN - 9780780389243

T3 - 2005 Workshop on High Performance Switching and Routing, HPSR 2005

SP - 421

EP - 425

BT - 2005 Workshop on High Performance Switching and Routing, HPSR 2005

ER -