Abstract
In this paper the Reactive Local Search (RLS) heuristic is proposed for the problem of minimizing the number of expensive Add-Drop multiplexers in a SONET or SDH optical network ring, while respecting the constraints given by the overall number of fibers and the number of wavelengths that can carry separate information on a fiber. RLS complements local search with a history-sensitive feedback loop that tunes the prohibition parameter to the local characteristics of a specific instance.
Simulation results are reported to highlight the improvement in ADM cost when RLS is compared with greedy algorithms used in the recent literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Battiti, R.: Reactive search: Toward self-tuning heuristics. In V. J. Rayward-Smith, editor, Modern Heuristic Search Methods, chapter 4, pages 61–83. John Wiley and Sons Ltd, 1996.
Battiti, R., Bertossi, A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers 48 (1999) 361–385
Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29 (2001) 610–637
Berry, R., Modiano, E.: Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic. IEEE Journal on selected areas in communications 18 (2000) 1961–1971
Chiu, A., Modiano, E.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE Journal of Lightwave Technology 18 (2000) 2–12
Glover, F.: Tabu search — part I. ORSA Journal on Computing 1 (1989) 190–206
Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44 (1990) 279–303
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. BellSystems TechnicalJournal 49 (1970) 291–307
Steiglitz, K, Weiner, P.: Some improved algorithms for computer solution of the traveling salesman problem. Proceedings of the Sixth Allerton Conference on Circuit and System Theory (Urbana, IL, 1968) 814–821
Wan, P.-J., Călinescu, G., Liu, L., Frieder, O.: Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journalon Selected Areas in Communications, 18 (2000) 1995–2003
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Battiti, R., Brunato, M. (2001). Reactive Search for Traffic Grooming in WDM Networks. In: Palazzo, S. (eds) Evolutionary Trends of the Internet. IWDC 2001. Lecture Notes in Computer Science, vol 2170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45400-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-45400-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42592-2
Online ISBN: 978-3-540-45400-7
eBook Packages: Springer Book Archive