Integrated routing algorithms for anycast messages

The use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same path for anycast packets from a source, while multipath routing splits anycast traffic into several different paths. The former is simple and easy to implement, while the latter may potentially reduce congestion, improving delay and throughput performance. However, multipath routing may require additional cost to maintain multipath information. To take advantage of both approaches and overcome their shortcomings, we develop a set of integrated routing algorithms that can adaptively select a subset of routers in the network to carry out multipath routing for anycast messages. We demonstrate that systems using our integrated routing algorithms perform substantially better than those where either the single-path or multipath approach is used alone.

[1]  Erik Guttman,et al.  Service Location Protocol: Automatic Discovery of IP Network Services , 1999, IEEE Internet Comput..

[2]  Nicholas F. Maxemchuk,et al.  Dispersity Routing in High-Speed Networks , 1993, Comput. Networks ISDN Syst..

[3]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[4]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.

[5]  Nen-Fu Huang,et al.  Some Routing Problems on Broadband ISDN , 1994, Comput. Networks ISDN Syst..

[6]  Alain Jean-Marie,et al.  Stochastic comparisons for queueing models via random sums and intervals , 1992, Advances in Applied Probability.

[7]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[8]  James P. Bound,et al.  Ipv6 Anycasting Service: Minimum Requirements for End Nodes , 1996 .

[9]  E. Gustafsson,et al.  A literature survey on traffic dispersion , 1997, IEEE Netw..

[10]  Wei Zhao,et al.  Integrated routing algorithms for anycast messages , 2000, IEEE Communications Magazine.

[11]  David Waitzman,et al.  A 50-Gb/s IP router , 1998, TNET.

[12]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[13]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[14]  M. Schwartz,et al.  The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks , 1976, IEEE Trans. Commun..

[15]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM 1989.

[16]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[17]  S. T. Buckland,et al.  An Introduction to the Bootstrap. , 1994 .

[18]  Anthony Ephremides,et al.  The Routing Problem in Computer Networks , 1986 .

[19]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[20]  Stephen E. Deering,et al.  Multicast routing in internetworks and extended LANs , 1988, CCRV.

[21]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[22]  Stephen E. Deering,et al.  Internet Protocol, Version 6 (IPv6) Specification , 1995, RFC.

[23]  Charles E. Perkins,et al.  Service Location Protocol , 1997, RFC.

[24]  Ellen W. Zegura,et al.  Application-layer anycasting , 1997, Proceedings of INFOCOM '97.

[25]  Weijia Jia,et al.  Routing algorithms for anycast messages , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[26]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..