Abstract
In this paper we consider a logical topology design problem on DWDM optical networks where the traffic is quantized at sub-wavelength resolution and the critical factor to determine the fitness of a solution is the number of lightpaths required, that is proportional to the number of hardware modules to handle the traffic.
The problem has been shown to be NP-hard. We review some of the previous work in the field, examine a number of regular but unsatisfactory solutions and describe a greedy-based iterated heuristic belonging to the GRASP family to minimise the number of lightpaths.
At the end we present some experimental results that compare our GRASP heuristic with other greedy-based methods and with regular topologies.
Keywords
Download to read the full chapter text
Chapter PDF
References
Richard Barr and Raymond A. Patterson. Grooming telecommunications networks. Optical Networks Magazine, 2 (3), 2001.
Roberto Battiti and Mauro Brunato. Reactive search for traffic grooming in WDM networks. In S. Palazzo, editor, Evolutionary Trends of the Internet, IWDC2001, Taormina, Lecture Notes in Computer Science LNCS 2170, pages 56–66. Springer-Verlag, September 2001.
Randall Berry and Eytan H. Modiano. Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic. IEEE Journal on selected areas in communications, 18 (10): 1961–1971, October 2000.
Gruia Calinescu and Peng-Jun Wan. Traffic partition in WDM/SONET rings to minimize SONET ADMs. In IWST 2001, 2001.
Angela L. Chiu and Eytan H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE Journal of Lightwave Technology, 18 (1): 2–12, January 2000.
J. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: A novel approach to high bandwidth optical WANs. IEEE Transactions on Communications, 40 (7): 1171–1182, 1992.
Aura Ganz and Xudong Wang. Efficient algorithm for virtual topology design in multihop lightwave networks. IEEE/ACM Transactions on Networking, 2 (3): 217–225, June 1994.
On Gerstel, Philip Lin, and Galen Sasaki. Wavelength assignment in a WDM ring to minimize the cost of embedded SONET rings. In Proceedings of INFOCOMI998, 1998.
On Gerstel and Rajiv Ramaswami. Cost effective grooming in WDM rings. In INFOCOM1998, 1998.
Oman Gerstel, Rajiv Ramaswami, and Galen H. Sasaki. Cost-effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking, 8 (5): 618–630, October 2000.
V. R. Konda and T. Y. Chow. Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In IEEE HPSR2001, 2001.
Rajesh M. Krishnaswami and Kumar N Sivarajan. Design of logical topologies: A linear formulation for wavelength routers with no wavelength changers IEEE/ACM Transactions on Networking, 9 (2): 186–198, April 2001.
Emilio Leonardi, Marco Mellia, and Marco Ajmone Marsan. Algortihms for the topology design in WDM all-optical networks. Optical Networks Magazine, 1 (1): 35–46, January 2000.
Liwu Liu, Xiangyang Li, Peng-Jun Wan, and Ophir Frieder. Wavelength assignment in WDM rings to minimize SONET ADMs. In INFOCOM 2000, pages 1020–1025, 2000.
R. Ramaswami and K. N. Sivarajan. Design of logical topologies for wavelength-routed optical networks. In Proceedings of 1NFOCOM 1995, 1995.
Mauricio G. C. Resende and Celso C. Ribeiro. Greedy randomized adaptive search procedures. In E Glover and G. Kochenberger, editors, Stare-of-the-Art Handbook in Meta-heuristics. Kluwer Academic Publisher, 2001. To appear.
D. A. Schupke and D. Sellier. Lightpath configuration of transparent and static WDM networks for IP traffic. In I C CC2001, 2001.
Peng-Jun Wan, Gruia Calinescu, Liwu Liu, and Ophir Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications, 18 (10): 1995–2003, October 2000.
Xijun Zhang and Chunming Qiao. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Transactions on Networking, 8 (5): 608–617, October 2000.
Keyao Thu and Biswanath Muldietjee. Traffic grooming in an optical wdm mesh network. In ICC2001, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Brunato, M., Battiti, R. (2003). A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies. In: Bianco, A., Neri, F. (eds) Next Generation Optical Network Design and Modelling. ONDM 2002. IFIP Advances in Information and Communication Technology, vol 114. Springer, New York, NY. https://doi.org/10.1007/978-0-387-35670-9_27
Download citation
DOI: https://doi.org/10.1007/978-0-387-35670-9_27
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-6000-2
Online ISBN: 978-0-387-35670-9
eBook Packages: Springer Book Archive