Anycast routing and wavelength assignment problem on WDM network

IEICE Transactions on Communications

Volumn E88-B, Issue 10, 2005, Pages 3941-3951

  Din, Der Rong ^a  

^a NATIONAL CHANGHUA UNIVERSITY OF EDUCATION   (Taiwan)

Author keywords

Anycast; Genetic algorithm; NP hard; Routing and wavelength assignment; WDM

Indexed keywords

GENETIC ALGORITHMS; PROBLEM SOLVING; TELECOMMUNICATION LINKS; WAVELENGTH DIVISION MULTIPLEXING;

ANYCAST; NP-HARD; ROUTING AND WAVELENGTH ASSIGNMENT;

TELECOMMUNICATION NETWORKS;

EID: 29144502410     PISSN: 09168516     EISSN: 17451345     Source Type: Journal    
DOI: 10.1093/ietcom/e88-b.10.3941     Document Type: Article

References (24)

1. R. Ramaswami and K.N. Sivarajan, Optical Networks: A Practical Perspective, Morgan Kaufmann, San Francisco, CA, 1998.
2. L. Wuttisittikulkij and M.J. O'Mahony, "Design of efficient and practical algorithm for wavelength assignment in multi-wavelength ring transport networks," Proc. IEEE GLOBECOM'97, pp.571-575, Phoenix, Arizona, USA, Nov. 1997.
3. N. Nagatsu, S. Okamoto, and K. Sato, "Optical path cross-connect system scale evaluation using path accommodation design for restricted wavelength multiplexing," IEEE J. Sel. Areas Commun., vol.14, no.5, pp.893-902, June 1996.
4. T. Lee, K. Lee, and S. Park, "Optimal routing and wavelength assignment in WDM ring networks," IEEE J. Sel. Areas Commun., vol.18, no.10, pp.2146-2154, Oct. 2000.
5. S. Suhramaniam and R.A. Barry, "Wavelength assignment in fixed routing WDM networks," Proc. IEEE Int. Conf. Commun., vol.1, pp.406-410, Montreal, Canada, June 1997.
6. S. Deering and R. Hinden, Internet Protocol Version 6 (Ipv6) Specification, RFC 2460, Dec. 1998.
7. C.P. Low and C.L. Tan, "On anycast routing with bandwidth constraint," Comput. Commun., vol.26, no.14, pp.1541-1550, Sept. 2003.
8. S.S. Dizit, IP over WDM: Building the Next Generation Optical Internet, John Wiley & Sons, Hoboken, NJ, 2004.
9. C. Qiao, M. Jeong, A. Guha, X. Zhang, and J. Wei, "WDM multicasting in IP over WDM networks," Proc. Int. Conf. on Network Protocols (ICNP), pp. 89-96, Toronto, Canada, Oct. 1999.
10. X. Zhang, J. Wei, and C. Qiao, "On fundamental issues in IP over WDM multicast," Proc. Int. Conf. on Comp. Commun. and Networks (IC3N), pp.84-90, Oct. 1999.
11. S. Hong, E.J. David, W. Liang, and Y. Wang, "Efficient multiple multicast in WDM networks," IEICE Trans. Inf. & Syst., vol.E82-D, no.6, pp.1074-1078, June 1999.
12. D.-R. Din, "Genetic algorithm for optimal multiple multicast problem," Comput. Commun., vol.27, no.9, pp.840-856, June 2004.
13. D.-R. Din, "Anycast-like routing problem on WDM ring," IEICE Trans. Commun., vol.E88-B, no.4, pp.1347-1354, April 2005.
14. J. Strand and Y. Xue, "Routing for optical networks with multiple routing domains," Optical Internetworking Forum (OIF) contribution 2001.046, Jan. 2001.
15. C. Ou, H. Zang, N.K. Singhal, K. Zhu, L.H. Sahasrabuddhe, R.A. MacDonald, and B. Mukherjee, "Subpath protection for scalability and fast recovery in optical WDM mesh networks," IEEE J. Sel. Areas Commun., vol.22, no.9, pp.1859-1875, Nov. 2004.
16. D. Xuan, W. Jia, and W. Zhao, "Routing algorithms for anycast messages," Proc. IEEE Conf. on Parall. Processing, pp.122-130, Aug. 1998.
17. D. Xuan, W. Jia, W. Zhao, and H. Zhu, "A routing protocol for anycast messages," IEEE Trans. Parallel Distrib. Syst., vol.11, no.6, pp.571-588, June 2000.
18. D. Xuan and W. Zhao, "Integrated routing algorithms for anycast messages," IEEE Commun. Mag., vol.38, no. 1, pp.48-53, Jan. 2000.
19. C.P. Low and X. Song, "On finding feasible solutions for the delay constrained group anycast routing problem," IEEE Trans. Comput., vol.51, no.5, pp.581-587, May 2002.
20. J. Holland, Adaptation in Natural and Artificial Systems, Univ. of Michigan Press (Ann Arbor), 1975.
21. A. Tucker, "Coloring a family of circular arcs," SIAM J. Appl. Math., vol.29, no.3, pp.493-502, 1975.
22. N. Shimamot, A. Hiramatu, and K. Yamasaki, "A dynamic routing control based on a genetic algorithm," IEEE Int. Conf. on Neur. Netw., pp. 1123-1128, San Francisco, California, March 1993.
23. R.-H. Hwang, W.-Y. Do, and S.-C. Yang, "Multicast routing based on genetic algorithms," J. Infor. Sci. and Engine., vol.16, no.4, pp.885-901, Nov. 2000.
24. D. Eppstein, "Finding the k shortest paths," SIAM J. Comput., vol.28, no.2, pp.652-673, April 1998.