Reactive search for traffic grooming in WDM networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2170 LNCS, Issue , 2001, Pages 56-66

  Battiti, Roberto ^a   Brunato, Mauro ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS; LOCAL SEARCH (OPTIMIZATION);

ADD DROP MULTIPLEXERS; FEED-BACK LOOP; GREEDY ALGORITHMS; LOCAL CHARACTERISTICS; MINIMIZING THE NUMBER OF; REACTIVE SEARCH; TRAFFIC GROOMING; WDM NETWORKS;

LOCAL SEARCH (OPTIMIZATION); TELECOMMUNICATION TRAFFIC;

EID: 84885226505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45400-4_5     Document Type: Conference Paper

References (10)

1. Battiti, R.: Reactive search: Toward self-tuning heuristics. In V. J. RaywardSmith, editor, Modern Heuristic Search Methods, chapter 4, pages 61-83. John Wiley and Sons Ltd, 1996.
2. Battiti, R., Bertossi, A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers 48 (1999) 361-385
3. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29 (2001) 610-637
4. 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
5. 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
6. Glover, F.: Tabu search - part I. ORSA Journal on Computing 1 (1989) 190-206
7. Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44 (1990) 279-303
8. Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal 49 (1970) 291-307
9. 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
10. 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