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

Learn More →

An efficient algorithm for reducing the number of Add-Drop Multiplexers in SONET/WDM rings

An efficient algorithm for reducing the number of Add-Drop Multiplexers in SONET/WDM rings This paper considers a network design problem introduced by Gerstel, Lin and Sasaki (INFOCOM'98) in which resource allocation is performed within a Wavelength Division Multiplexing (WDM) optical ring network to reduce overall equipment cost. The problem can be summarized as follows. The Add-Drop Multiplexers (ADM's) that are used to terminate lightpaths in an optical (SONET/SDH) ring are expensive. A naive implementation would require ADM's for each wavelength at each node. However, by carefully assigning connections to wavelengths and routing the resulting lightpaths, one may avoid terminating all wavelengths at every node, and thereby reduce the number of ADM's needed. While Gerstel et al. consider wavelength assignment with respect to this problem, they do not consider the additional complication of routing. In this paper, we consider joint routing and wavelength assignment, and show that the number of ADM's required is significantly less than the number resulting from applying the heuristics in Gerstel et al. Our algorithm analyzes connection requirements and, using a decomposition based on Euler paths, performs routing and wavelength assignment. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of High Speed Networks IOS Press

An efficient algorithm for reducing the number of Add-Drop Multiplexers in SONET/WDM rings

Guangzhi Li; Rahul Simha
Journal of High Speed Networks , Volume 11 (1) – Jan 1, 2002
Download PDF
11 pages

Loading next page...
 
/lp/ios-press/an-efficient-algorithm-for-reducing-the-number-of-add-drop-gXD8MMqlPT

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2002 by IOS Press, Inc
ISSN
0926-6801
eISSN
1875-8940
Publisher site
See Article on Publisher Site

Abstract

This paper considers a network design problem introduced by Gerstel, Lin and Sasaki (INFOCOM'98) in which resource allocation is performed within a Wavelength Division Multiplexing (WDM) optical ring network to reduce overall equipment cost. The problem can be summarized as follows. The Add-Drop Multiplexers (ADM's) that are used to terminate lightpaths in an optical (SONET/SDH) ring are expensive. A naive implementation would require ADM's for each wavelength at each node. However, by carefully assigning connections to wavelengths and routing the resulting lightpaths, one may avoid terminating all wavelengths at every node, and thereby reduce the number of ADM's needed. While Gerstel et al. consider wavelength assignment with respect to this problem, they do not consider the additional complication of routing. In this paper, we consider joint routing and wavelength assignment, and show that the number of ADM's required is significantly less than the number resulting from applying the heuristics in Gerstel et al. Our algorithm analyzes connection requirements and, using a decomposition based on Euler paths, performs routing and wavelength assignment.

Journal

Journal of High Speed Networks – IOS Press

Published: Jan 1, 2002

There are no references for this article.