Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Routing Mechanisms Employing Adaptive Weight Functions for Shortest Path Routing in Optical WDM Networks

Routing Mechanisms Employing Adaptive Weight Functions for Shortest Path Routing in Optical WDM... Optical dense wavelength division multiplexed (DWDM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider routing and wavelength assignment in a wide area wavelength routed backbone network that employs circuit-switching. When a session request is received by the network, the routing and wavelength assignment (RWA) task is to establish a lightpath between the source and destination. That is, determine a suitable path and assign a set of wavelengths for the links on this path. We consider a link state protocol approach and use Dijkstra’s shortest path algorithm, suitably modified for DWDM networks, for computing the shortest paths. In [1] we proposed WDM aware weight functions that included factors such as available wavelengths per link, total wavelengths per link. In this paper, we present new weight functions that exploit the strong correlation between blocking probability and number of hops involved in connection setup to increase the performance of the network. We also consider alternate path routing that computes the alternate paths based on WDM aware weight functions. The impact of the weight functions on the blocking probability and delay is studied through discrete event simulation. The system parameters varied include number of network nodes, wavelengths, degree of wavelength conversion, and load. The results show that the weight function that incorporates both hop count and available wavelength provides the best performance in terms of blocking probability. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Routing Mechanisms Employing Adaptive Weight Functions for Shortest Path Routing in Optical WDM Networks

Download PDF
10 pages

Loading next page...
 
/lp/springer-journals/routing-mechanisms-employing-adaptive-weight-functions-for-shortest-NtJehZz8WJ

References (15)

Publisher
Springer Journals
Copyright
Copyright © 2001 by Kluwer Academic Publishers
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
DOI
10.1023/A:1011495129926
Publisher site
See Article on Publisher Site

Abstract

Optical dense wavelength division multiplexed (DWDM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider routing and wavelength assignment in a wide area wavelength routed backbone network that employs circuit-switching. When a session request is received by the network, the routing and wavelength assignment (RWA) task is to establish a lightpath between the source and destination. That is, determine a suitable path and assign a set of wavelengths for the links on this path. We consider a link state protocol approach and use Dijkstra’s shortest path algorithm, suitably modified for DWDM networks, for computing the shortest paths. In [1] we proposed WDM aware weight functions that included factors such as available wavelengths per link, total wavelengths per link. In this paper, we present new weight functions that exploit the strong correlation between blocking probability and number of hops involved in connection setup to increase the performance of the network. We also consider alternate path routing that computes the alternate paths based on WDM aware weight functions. The impact of the weight functions on the blocking probability and delay is studied through discrete event simulation. The system parameters varied include number of network nodes, wavelengths, degree of wavelength conversion, and load. The results show that the weight function that incorporates both hop count and available wavelength provides the best performance in terms of blocking probability.

Journal

Photonic Network Communications – Springer Journals

Published: Oct 9, 2004

There are no references for this article.