Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

IEEE Journal on Selected Areas in Communications

Volumn 24, Issue 8 SUPPL., 2006, Pages 2-15

  Skorin Kapov, Nina ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Optical networks; Routing and wavelength assignment; Scheduled lightpath demands; Tabu search

Indexed keywords

EXECUTION TIME; GREEDY ALGORITHMS; LOWER BOUNDS; NP COMPLETE; OPTICAL NETWORKS; ROUTING AND WAVELENGTH ASSIGNMENT; SCHEDULED LIGHTPATH DEMAND; TABU SEARCH ALGORITHMS; WAVELENGTH CONVERTER; WAVELENGTH ROUTED OPTICAL NETWORKS;

FIBER OPTIC NETWORKS; LEARNING ALGORITHMS; TABU SEARCH; WAVELENGTH;

HEURISTIC ALGORITHMS;

EID: 51249106546     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2006.1677251     Document Type: Article

References (24)

1. I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: An approach to high-bandwidth optical WANs", IEEE Trans. Commun., vol. 40, pp. 1171-1182, July 1992.
2. D. Banerjee and B. Mukherjee, "A practical approach for routing and wavelength assignment in large wavelength-routed optical newtorks", IEEE J. Select. Areas Commun., vol. 14, pp. 903-908, June 1996.
3. J. S. Choi, N. Golmie, F. Lapeyere, F. Mouveaux, and D. Su, "A functional classification of routing and wavelength assignment schemes in DWDM networks: Static case", in Proc. VII Int. Conf. on Optical Communication and Networks, Nagoya, Japan, Jan. 2000.
4. P. Manohar, D. Manjunath, and R. K. Shevgaonkar, "Routing and wavelengths assignment in optical networks from edge disjoint paths algorithms", IEEE Commun. Lett., vol. 6, pp. 211-213, May 2002.
5. A. Ozdaglar and D. Bertsekas, "Routing and wavelength assignment in optical networks", IEEE/ACM Trans. Networking, vol. 11, pp. 259-272, Apr. 2003.
6. X. Jia, X.-D. Hu, and D.-Z. Du, Multiwavelength Optical Networks. Norwell, MA: Kluwer Academic Publishers, 2002.
7. B. Mukherjee, Optical Communication Networks. New York: McGraw-Hill, 1997.
8. C. Murthy and M. Gurusamy, WDM Optical Networks: Concepts, Design, and Algorithms. New Jersey: Prentice Hall, 2002.
9. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, and R. Douville, "Routing and wavelength assignment of scheduled lightpath demands", IEEE J. Select. Areas Commun., vol. 21, pp. 1231-1240, Oct. 2003.
10. D. Kirovski and M. Potkonjak, "Efficient coloring of a large spectrum of graphs", in Proc. 35th Conf. Design Automation, San Francisco, CA, June 1998, pp. 427-432.
11. J. Kuri, N. Puech, and M. Gagnaire, "Diverse routing of scheduled lightpath demands in an optical transport network", in Proc. Design of Reliable Communication Networks (DCRN2003), Oct. 2003, pp. 69-76.
12. C. Saradhi, L. Wei, and M. Guruswami, "Provisioning fault-tolerant scheduled lightpath demands in WDM mesh networks", in Proc. Broadband Networks, Oct. 2004, pp. 150-159. (Pubitemid 40731131)
13. F. Glover and M. Laguna, Tabu Search. Boston, MA: Kluwer Academic Publishers, 1997.
14. D. S. Johnson and M. A. Trick, Eds., Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1993, vol. 26.
15. R. Brooks, "On coloring the nodes of a network", in Proc. Cambridge Phil. Soc., vol. 37, 1941, pp. 194-197.
16. L. Stacho, "New upper bounds for the chromatic number of a graph", J. Graph Theory, vol. 36, no. 2, pp. 117-120, Feb. 2001.
17. D. Eppstein, "Finding the k shortest paths", SIAM J. Computing, vol. 28, no. 2, pp. 652-673, 1998.
18. J. Kuri, "Optimization problems in WDM optical transport networks with scheduled lightpath demands", Ph. D. dissertation, Ecole Nationale Supérieure des Télécommunications, France, Sept. 2003.
19. J. M. Kleinberg, "Approximation algorithms for disjoint paths problems", Ph. D. dissertation, MIT, Cambridge, May 1996.
20. N. Skorin-Kapov, "Routing and wavelength assignment in optical networks using bin packing based algorithms", Europ. J. Op. Res., to be published.
21. R. Floyd, "Algorithm 97: Shortest paths", Comm. Of the AMC, vol. 5, no. 6, p. 345, 1962.
22. R. Ramaswami and K. N. Sivarajan, "Design of logical topologies for wavelength-routed optical networks", IEEE J. Select. Areas Commun., vol. 14, no. 5, pp. 840-851, June 1996.
23. S. Kirckpatrick and E. Stoll, "A very fast shift-register sequence random number generator", J. Computational Physics, vol. 40, pp. 517-526, 1981.
24. B. M. R. Inkret, A. Kuchar, Advanced Infrastructure for Photonic Networks: Extended Final Report of COST Action 266. Zagreb: Faculty of Electrical Engineering and Computing, University of Zagreb, 2003, pp. 19-21.