On anycast routing with bandwidth constraint

Computer Communications

Volumn 26, Issue 14, 2003, Pages 1541-1550

  Low, Chor Ping ^a   Tan, Choon Leng ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Anycast routing; Heuristic algorithm; Lower bound; NP completeness

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; OPTIMIZATION; PROBLEM SOLVING;

HEURISTIC ALGORITHMS;

COMPUTER NETWORKS;

EID: 0038487240     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(03)00132-4     Document Type: Article

References (8)

1. S. Deering, R. Hinden, Internet Protocol Version 6 (Ipv6) Specification, RFC 2460, December 1998.
2. Low C.P., Song X. On finding feasible solutions for the delay constrained group multicast routing problem. IEEE Transactions on Computers. 51:(5):2002;581-587.
3. Xuan D., Jia W., Zhao W. Routing algorithms for anycast messages. Proceedings of IEEE Conference on Parallel Processing. 122:1998;130.
4. Xuan D., Jia W., Zhao W., Zhu H. A routing protocol for anycast messages. IEEE Transactions on Parallel and Distributed Systems. 11:(6):2000;571-588.
5. Xuan D., Zhao W. Integrated routing algorithms for anycast messages. IEEE Communications Magazine. 38:2000;48-53.
6. Reeves C.R. Modern Heuristic Techniques for Combinatorial Problems. 1993;Wiley, New York. pp. 267-273.
7. Bagchi A. Route selection with multiple metrics. Information Processing Letter. 64:1997;203-205.
8. Wazman B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications. 6:(9):1988;1617-1622.