Routing and wavelength assignment of scheduled lightpath demands

IEEE Journal on Selected Areas in Communications

Volumn 21, Issue 8, 2003, Pages 1231-1240

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

^a TELECOM PARISTECH   (France)

^b NOKIA RESEARCH CENTER   (United States)

Author keywords

Branch and bound (B B); Combinatorial optimization; Graph coloring; Routing and wavelength assignment (RWA); Scheduled demands; Tabu search (TS)

Indexed keywords

DATA COMMUNICATION SYSTEMS; FIBER OPTIC NETWORKS; GRAPH THEORY; OPTIMIZATION; ROUTERS; TELECOMMUNICATION TRAFFIC; WAVELENGTH DIVISION MULTIPLEXING;

ROUTING AND WAVELENGTH ASSIGNMENT; SCHEDULED DEMAND; TABU SEARCH;

OPTICAL COMMUNICATION;

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

References (17)

1. Architecture of Optical Transport Network, ITU-T Recommendation G.872, Nov. 2001.
2. Management of the Transport Network, ITU-T Recommendation G.852, Mar. 1999.
3. Requirements for the Automatic Switched Transport Network (ASTN), ITU-T Recommendation G.807, July 2001.
4. Generalized Multi-Protocol Label Switching (GMPLS) Architecture, E. Mannie, Ed., IETF ccamp group, Mar. 2002. Work in progress.
5. Advanced Networking for Research and Education [Online]. Available: http://abilene.internet2.edu/
6. H. Zang, J. Jue, and B. Mukherjee, "A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks," Opt. Networks Mag., vol. 1, no. 1, pp. 47-60, 2000.
7. D. Eppstein, "Finding the k shortest paths," SIAM J. Computing, vol. 28, no. 2, pp. 652-673, 1998.
8. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, "Routing and wavelength assignment of scheduled lightpath demands in a WDM optical transport network," in Proc. ICOCN 2002, Singapore, Nov. 2002, pp. 270-273.
9. J. Clausen, "Branch and Bound Algorithms-Principles and Examples," Dept. Comput. Sci., Univ. Copenhagen, [Online]. Available: http://www.imm.dtu.dk/~jha/.
10. J. Clausen and M. Perregaard, "On the best search strategy in parallel branch-and-bound-Best-first-search vs. lazy depth-first-search," Annals of Operations Research, No. 90, pp. 1-17, 1999.
11. F. Glover and M. Laguna, Tabu Search. Boston, MA: Kluwer-Academic, 1997.
12. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, "Routing foreseeable lightpath demands using a tabu search meta-heuristic," in Proc. GLOBECOM 2002, Taipei, Taiwan, Nov. 2002, pp. 2803-2807.
13. 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.
14. I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: An approach to high bandwith optical WAN's," IEEE Trans. Commun., vol. 40, pp. 1171-1182, July 1992.
15. A. Marzetta, "ZRAM: A Library of Parallel Search Algorithms and Its Use in Enumeration and Combinatorial Optimization," Ph.D. dissertation, Comput, Sci. Dept., Swiss Fed. Inst. Technol., Zurich, Switzerland, 1998.
16. S. Kirkpatrick and E. Stoll, "A very fast shift-register sequence random number generator," J. Comput. Phys., vol. 40, 1981.
17. J. Kuri, N. Puech, and M. Gagnaire, "Diverse routing of scheduled light-path demands in an optical transport network," 4th Workshop on Design of Reliable Computer Networks, Oct. 2003, submitted for publication.