This Article 
 Bibliographic References 
 Add to: 
A Routing Protocol for Anycast Messages
June 2000 (vol. 11 no. 6)
pp. 571-588

Abstract—An anycast packet is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. Little work has been done on routing anycast packets. In this paper, we propose and analyze a routing protocol for anycast message. It is composed of two subprotocols: the routing table establishment subprotocol and the packet forwarding subprotocol. In the routing table establishment subprotocol, we propose four methods (SSP, MIN-D, SBT, and CBT) for enforcing an order among routers for the purpose of loop prevention. These methods differ from each other on information used to maintain orders, the impact on QoS, and the compatibility to the existing routing protocols. In the packet forwarding subprotocol, we propose a Weighted-Random Selection (WRS) approach for multiple path selection in order to balance network traffic. In particular, the fixed and adaptive methods are proposed to determine the weights. Both of them explicitly take into account the characteristics of distribution of anycast recipient group while the adaptive method uses the dynamic information of the anycast traffic as well. Correctness property of the protocol is formally proven. Extensive simulation is performed to evaluate our newly designed protocol. Performance data shows that the loop-prevention methods and the WRS approaches have great impact on the performance in terms of average end-to-end packet delay. In particular, the protocol using the SBT or CBT loop-prevention methods and the adaptive WRS approach performs very close to a dynamic optimal routing protocol in most cases.

[1] S. Bhattacharjee, M.H. Ammar, E.W. Zegura, V. Shah, and Z. Fei, “Application-Layer Anycasting,” Proc. IEEE INFOCOM’97, Apr. 1997.
[2] A.J. Ballardie, P.F. Francis, and J. Crowcroft, “Core Based Trees,” Proc. ACM SIGCOM, 1993.
[3] J. Bound., “Ipv6 Anycasting Service: Minimum Requirements for End Nodes,” draft-bound-anycast-00.txt, June 1996.
[4] D.G. Cantor and M. Gerla, “Optimal Routing in a Packet-Switched Computer Network,” IEEE Trans. Computer, vol. 23, no. 10, Oct. 1974.
[5] I. Cidon, R. Rom, “Multi-Path Routing Combined with Resource Reservation,” Proc. IEEE INFOCOM '97, Apr. 1997.
[6] S.E. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei, “The PIM Architecture for Wide-Area Multicast Routing,” IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 153-162, Apr. 1996.
[7] S. Deering and R. Hinden, “Internet Protocol Version 6 (IPv6) Specification,” RFC 2460, Dec. 1998.
[8] S. Deering, “Multicast Routing in Internetworks and Extended LANs,” Proc. SIGCOMM, Aug. 1988.
[9] A. Ephremides, “The Routing Problem in Computer Networks,” Comm. and Networks, I. Blake and H. Poor, eds. New York: Springer Verlag, 1986.
[10] L. Fratta, M. Cerla, and L. Kleinrock, “The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design,” Networks, vol. 3, 1973.
[11] H. Frank and W. Chou, “Routing in Computer Networks,” Networks, vol. 1, 1971.
[12] D. Gross and C.M. Harris,Fundamentals of Queueing Theory, 2nd edition. New York: John Wiley&Sons, 1985.
[13] R.G. Gallager, “A Minimum Delay Routing Algorithms Using Distributed Computation,” IEEE Trans. Comm., vol. 25, no. 1, Jan. 1977.
[14] R. Hinden and S. Deering, “IP Version 6 Addressing Architecture,” RFC 1884, Dec. 1995.
[15] C.L. Hedricks, “An Introduction to IGRP, Center for Computer and Information Services, Laboratory for Computer Science Research, Rutgers University, Aug. 22, 1991.
[16] A. Jean-Marie and L. Gun, “Parallel Queues with Resequencing,” J. ACM, vol. 40, no. 5, Nov. 1993.
[17] A. Jean-Marie and Z. Liu, “A Stochastic Comparison for Queuing Models via Random Sums and Intervals,” J. Advanced Applied Probabilities, no. 24, 1992.
[18] A.I. Khuri, Advanced Calculus with Applications in Statistics. John Wiley and Sons, 1993.
[19] J. Moy, “OSPF Version 2,” RFC 1583, Mar. 1994.
[20] J. Moy, “Multicast Extensions to OSPF,” RFC 1584, Mar. 1994.
[21] M. Parsa and J.J. Garcia-Luna-Aceves, “A Protocol for Scalable Loop-Free Multicast Routing. Selected Areas in Communications,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, Apr. 1997.
[22] C. Partridge, T. Mendez, and W. Milliken., “Host Anycasting Service,” RFC 1546, Nov. 1993.
[23] M. Schwartz and C.K. Cheung, “The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks,” IEEE Trans. Comm., vol. 24, no. 4, Apr. 1976.
[24] D.G. Thaler and C.V. Ravishankar, “Distributed Center-Location Algorithms,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 291-303, Apr. 1997.

Index Terms:
Anycast message, multiple path routing, shortest path first, weight assignment.
Dong Xuan, Weijia Jia, Wei Zhao, Hongwen Zhu, "A Routing Protocol for Anycast Messages," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 6, pp. 571-588, June 2000, doi:10.1109/71.862208
Usage of this product signifies your acceptance of the Terms of Use.