Routing and wavelength assignment of scheduled lightpath demands
暂无分享,去创建一个
Emmanuel Dotaro | Maurice Gagnaire | Richard Douville | Josué Kuri | Nicolas Puech | M. Gagnaire | N. Puech | E. Dotaro | J. Kuri | R. Douville
[1] Emmanuel Dotaro,et al. ROUTING AND WAVELENGTH ASSIGNMENT OF SCHEDULED LIGHTPATH DEMANDS IN A WDM OPTICAL TRANSPORT NETWORK , 2002 .
[2] Maurice Gagnaire,et al. Diverse routing of scheduled lightpath demands in an optical transport network , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..
[3] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[4] J. Clausen,et al. Branch and Bound Algorithms-Principles and Examples , 2003 .
[5] Eric Mannie,et al. Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.
[6] Emmanuel Dotaro,et al. Routing foreseeable lightpath demands using a tabu search meta-heuristic , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[7] Imrich Chlamtac,et al. Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..
[8] Ambros Marzetta,et al. ZRAM: a library of parallel search algorithms and its use in enumeration and combinatorial optimization , 1998 .
[9] Scott Kirkpatrick,et al. A very fast shift-register sequence random number generatorjournal of computational physics , 1981 .
[10] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..
[11] J. Limb,et al. Editorial on the IEEE/OSA Journal of Lightwave Technology and the IEEE Journal on Selected Areas in Communications , 1986 .
[12] Jens Clausen,et al. On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search , 1999, Ann. Oper. Res..
[13] Miodrag Potkonjak,et al. Efficient coloring of a large spectrum of graphs , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).