Routing Foreseeable Lightpath Demands using a tabu search meta-heuristic

Conference Record / IEEE Global Telecommunications Conference

Volumn 3, Issue , 2002, Pages 2803-2807

  Kuri, Josué ^a   Puech, Nicolas ^a   Gagnaire, Maurice ^a   Dotaro, Emmanuel ^b  

^a TELECOM PARISTECH   (France)

^b NONE

Author keywords

Dynamic lightpath provisioning; Optical networks; Routing; Tabu search; WDM

Indexed keywords

ALGORITHMS; BANDWIDTH; DATA COMMUNICATION SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION LINKS;

OPTICAL NETWORKS;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 0036970601     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. R. Ramaswami and K. Sivarajan, Optical Networks: A Practical Perspective, Morgan Kaufmann Publishers, San Francisco, CA, 1998.
2. D. Eppstein, "Finding the k shortest paths," SIAM Journal of Computing, vol. 28, no. 2, pp. 652-673, 1998.
3. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, MA, 1997.
4. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, "Optimal routing of foreseeable lightpath demands in a wdm mesh network," in Submitted to Optical Networking and Communications Conference 2002., July 2002.
5. S. Kirkpatrick and E. Stoll, "A very fast shift-register sequence random number generator," Journal of Computational Physics, vol. 40, 1981.