Tony Ballardie
Abstract
One of the central problems in one-to-many wide-area communications is forming the delivery tree - the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these.In this paper we show how the current IP multicast architecture scales poorly (by scale poorly, we mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. We also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms.
- 1 J. E. Hopcroft A. V. Aho and J. D. Ullman. Data Structures and Algrorithms. Addison-Wesley, Reading, Mass, U.S.A., 1983.]] Google Scholar
Digital Library
- 2 Lee Breslau and Deborah Estrin. Design and Evaluation of Inter-Domain Policy Routing Protocols. Internetworking: Research and Ezperience, 2:177- 198, September 1991.]]Google Scholar
- 3 Scott Brim and John Moy. Support for Multicast Communications Across Wide-Area Networks. High Performance Network Research Report, Cotnell Univ., June 1992.]]Google Scholar
- 4 Ching-Hua Chow. On Multicast Path Finding Algorithms. In Infocom, Conference on Computer Communicaiions, pages 1274-1283. IEEE, April 1991.]]Google Scholar
- 5 C. Partridge D. Waitzman and S. Deering. RFC 1075, Distance Vector Multicast Routing Protocol. SRI Network Information Center, November 1988.]] Google ScholarDigital Library
- 6 Y. K. Dalal and R. M. Metcalfe. Reverse Path Forwarding of Broadcast Packets. CommunicatioNs of the A CM, 21:1040-1048, December 1978.]] Google ScholarDigital Library
- 7 Martin de Prycker. Asynchronous Transfer Mode. Ellis Horwood Limited, Chichester, England, 1991.]] Google ScholarDigital Library
- 8 S. E. Deering. Multicast Routing in Internetworks and Extended LANs. In A CM Symposium on Communicatio~ Architectures a~d Protocols, pages 55- 64. ACM SIGCOMM, August 1988.]] Google ScholarDigital Library
- 9 S. E. Deering. Multicast Routing in a Datagram Internetwork. PhD thesis, Stanford University, California, U.S.A., 1991.]] Google ScholarDigital Library
- 10 S. E. Hardcastle-Kille. RFC 1279, X.500 and Domains. SRI Network Information Center, September 1991.]] Google ScholarDigital Library
- 11 B. Kahle M. Schwartz, A. Emtage and B. Neuman. A Comparison of Internet Resource Discovery Approaches. Computing Systems, 5 (4):461-493, Fall 1992.]]Google Scholar
- 12 D. Piscitcllo. RFC 1209, The Transmission of IP Datagrams over the SMDS Service. SRI Network Information Center, March 1991.]] Google ScholarDigital Library
- 13 S. Zabele R. Braudes. RFC 1458, Requirements for Multicast Protocols. $RI Network Information Cegter, May 1993.]] Google ScholarDigital Library
- 14 David W. Wall. Mechanisms for Broadcast a~d Selective Broadcast. PhD thesis, Stanford University, California, U.S.A., June, 1980.]] Google ScholarDigital Library
- 15 S. Wilbur and M. Handley. Multimedia Conferencing' from Prototype to National Pilot. In INET'92, International Networking Conference, pages 483- 490, June 1992.]]Google Scholar
Index Terms
- Core based trees (CBT)
Recommendations
Core based trees (CBT)
SIGCOMM '93: Conference proceedings on Communications architectures, protocols and applicationsOne of the central problems in one-to-many wide-area communications is forming the delivery tree - the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the ...
Comments