Routing algorithms for anycast messages

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 1998, Pages 122-130

  Xuan, Dong ^a   Jia, Weijia ^a   Zhao, Wei ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORRECTNESS PROPERTIES; MESSAGE TRAFFIC; OPTIMAL ALGORITHM; RANDOM SELECTION; ROUTING TECHNOLOGIES; SHORTEST PATH FIRSTS; SIMULATION STUDIES; UNICAST PACKETS;

ROUTING ALGORITHMS;

EID: 0037712066     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1998.708471     Document Type: Conference Paper

References (32)

1. [BAZSF97] S. Bhattacharjee, M.H. Ammar, E.W. Zegura, V. Shah and Z. Fei. Application-Layer Anycasting. Proc. of IEEE INFOCOM, 1997.
2. [BZ92] S. Bahk, M.El. Zarki. A Dynamic multi-Path Routing Algorithm for ATM Networks. J. of High Speed Networks, Vol. 1, No. 3, 1992.
3. [B96] J. Bound. Ipv6 Anycasting Service: Minimum Requirements for End Nodes. draft-bound-anycast-00.txt, June 1996.
4. [CG74] D. G. Cantor and M. Gerla. Optimal Routing in a Packet-Switched Computer Network, IEEE trans. on Comp, Vol. C-23, Oct. 1974.
5. [CR97] I. Cidon and R. Rom. Multi-Path Routing Combined with Resource Reservation. Proc. of IEEE INFOCOM, 1997.
6. [DH95] S. Deering and R. Hinden. Internet Protocol, Version 6, Specification. RFC 1883, December 1995.
7. [D59] E.W. Dijkstra. A Note on Two Problems in Connection with Graphs, Numer. Math. Vol. 1, 1959.
8. [D88] S. Deering. Multicast Routing in Internetworks and Extended LANs. Proc. of SIGCOMM, 1988.
9. [DEFJLW96] S. Deering, D. L. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L. Wei. The PIM Architecture for Wide-Area Multicast Routing. IEEE/ACM Trans. on Networking, Vol. 4, No. 2, April 1996.
10. [E86] A. Ephremides. The Routing Problem in Computer Networks. I. Blake and H. Poor, eds., Comm and Networks, 1986.
11. [FCK73] L. Fratta, M. Cerla, and L. Kleinrock. The Flow Deviation Method: An Approach to Store-and-Forwad Communication Network Design. Networks, Vol 3, 1973.
12. [FC71] H. Frank and W. Chou. Routing in Computer Networks. Networks, Vol.1, 1971.
13. [GH85] D. Gross and C.M. Harris. Fundamentals of Queueing Theory. John Wiley & Sons, Inc. 1985.
14. [GK97] E. Gustafsson and G. Karlsson. A Literature Survey on Traffic Dispersion. IEEE Network, Vol. 11, No. 2, March/April 1997.
15. [G77] R.G. Gallager. A Minimum Delay Routing Algorithms Using Distributed Computation. IEEE Trans on Comm, Vol. COM-25, No. 1, January 1977.
16. [HD95] R. Hinden and S. Deering. IP Version 6 Addressing Architecture. RFC 1884, December 1995.
17. [H91] C.L. Hedricks. An Introduction to IGRP. Center for Computer and Information Services, Rutgers University, August, 1991.
18. [JG93] A. Jean-Marie and L. Gun. Parallel Queues with Resequencing. J-ACM, Vol 40, No. 5, November 1993.
19. [JL92] A. Jean-Marie and Z. Liu. A Stochastic Comparison for Queuing Models via Random Sums and Intervals. Journal of Advanced Applied Probabilities, No. 24, 1992.
20. [KJ83] K.B. Kumar and J. M. Jaffe. Routing to Multiple Destinations in Computer Networks. IEEE Trans. on Comm, COM-31, No.3, March 1983.
21. [KZ89] A. Khanna and J. Zinky. The Revised ARPANET Routing Metric. Proc. of ACM SIGCOMM, 1989.
22. [MTW93] J.E. Marsden and A.J. Tromba, A. Weinstein. Basic Multivarible Calculus. Springer-Verlag, Inc. 1993
23. [M93] N. F. Maxemchuk. Dispersity Routing in High-Speed Networks. Computer Networks and ISDN System, Vol. 25, No. 6, 1993.
24. [M94a] J. Moy. OSPF Version 2. RFC1583, March 1994.
25. [M94b] J. Moy. Multicast Extensions to OSPF. RFC 1584, March 1994.
26. [PMM93] C. Partridge, T. Mendez, and W. Milliken. Host Anycasting Service. RFC1546, November 1993.
27. [SAN92] D. Sidhu, S. Abdullah, and R. Nair. Congestion Control in high Speed networks via Alternate path Routing. J. of High Speed networks, Vol. 1, No. 2, 1992
28. [SC76] M. Schwartz and C.K. Cheung. The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks. IEEE Trans. on Comm., Vol. COM-24, No. 4, April 1976.
29. [SS80] M. Schwartz and T. Stern. Routing Techniques Used in Computer Communications Networks. IEEE Trans. on Comm., Vol. COM-28, No.4, April 1980.
30. [WC90] Z. Wang and J. Crowcroft. Shortest Path First with Emergency Exits. Proc. of SIGCOMM, 1990.
31. [XJZ97] D. Xuan, W. Jia, and W. Zhao. Formal Properties of Routing Algorithms for Anycast Messages, Tech. Rep., CS Dept. City Univ. Hong Kong, July, 1997.
32. [XJZ98] D. Xuan, W. Jia and W. Zhao. Hierarchical Routing Algorithms for Anycast Messages, Tech. Rep., CS Dept. Texas A&M Univ. College Station, May, 1998.