Reactive Search for Traffic Grooming in WDM Networks

Authors:
Roberto Battiti;Mauro Brunato
Affiliations:
-;-
Venue:
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Year:
2001

Citing 3
Cited 1

Algorithms for the maximum satisfiability problem

Computing
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning

IEEE Transactions on Computers
Grooming of arbitrary traffic in SONET/WDM BLSRs

IEEE Journal on Selected Areas in Communications

Minimum cost dimensioning of ring optical networks

Optical Switching and Networking

Quantified Score

Hi-index	0.00

Visualization

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.