A simple scheme for routing and wavelength assignment in WDM networks

Authors:
Khaled Maamoun;Hussein T. Mouftah
Affiliations:
University of Ottawa, Ottawa, Ontario, Canada;University of Ottawa, Ottawa, Ontario, Canada
Venue:
Proceedings of the 2008 Spring simulation multiconference
Year:
2008

Citing 2
Cited 0

Survivable Networks: Algorithms for Diverse Routing

Survivable Networks: Algorithms for Diverse Routing
Toward Optimal Routing of Lightpaths in Dynamic WDM Networks

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing and wavelength assignment (RWA) is an important and difficult topic in wavelength division multiplexing (WDM) networks if the node blocking probability is taken into consideration. Here we introduce a new method aimed at minimizing this problem by finding the most suitable route for a coming connection request based on blocking probability estimation at every node. This novel and simple method is achieved by transforming the node-weights to link-weights and finding the route on the new transformed network using the well known Dijkstra's algorithm to find the shortest path.