skip to main content
article
Free Access

Building shared trees using a one-to-many joining mechanism

Authors Info & Claims
Published:01 January 1997Publication History
Skip Abstract Section

Abstract

This paper presents a new approach for building shared trees which have the capability of providing multiple routes from the joining node onto an existing tree. The approach follows a design parameter of CBT and PIM in that it operates independently of any unicast routing protocol. However, a paradigm shift is introduced such that trees are built in an on-demand basis through the use of a one-to-many joining mechanism. In addition, the paper presents optimisations of the new mechanism to help constrain its impact in the case where many receivers exist for a given multicast group.

References

  1. {1} Deering, D. Estrin, D. Farinacci, M. Handley, A. Helmy, "Protocol Independent Multicast - Sparse Mode (PIM-SM)", Internet Draft -- Work in Progress, July, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. {2} Ballardie, "Core Based Trees (CBT) Multicast Architecture", Internet Draft -- Work in Progress, February, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. {3} Moy, "OSPF Version 2", RFC 1584, March 1994.Google ScholarGoogle Scholar
  4. {4} Crawley. Presentation at Montreal IETF, June 1996.Google ScholarGoogle Scholar
  5. {5} Castineyra, J. Chiapa, M. Steenstrup, "The Nimrod Routing Architecture", Internet Draft - Work in Progress, February, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. {6} Braden, L. Zhang, S. Berson, S. Herzog, S. Jamin "Resource Reservation Protocol -- Version 1 Functional Specification", Internet Draft - Work in Progress, May 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. {7} Shenker, L. Breslau, "Two Issues in Reservation Establishment", Proceedings of ACM Sigcomm '95, August, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. {8} Deering, "Host Extensions for IP Multicasting", RFC1112, August 1989.Google ScholarGoogle Scholar
  9. {9} Mockapetris, "Domain Names - Concept and Specification", RFC 1035, Nov, 1987.Google ScholarGoogle Scholar
  10. {10} Handley, V. Jacobson, "SDP: Session Directory Protocol (draft 2.1)", Internet Draft -- Work in Progress, February 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. {11} Vixie, S. Thomson, Y. Rekhter, "Dynamic Updates in the Domain Name System", March, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. {12} Handley, J. Crowcroft, I. Wakeman, "Hierarchical Protocol Independent Multicast (HPIM)", white paper, October, 1995.Google ScholarGoogle Scholar
  13. {13} Deering, "Multicast Routing in a Datagram Internetwork." PhD thesis, Stanford University, California, USA, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. {14} Dalal, R. Metcalf, "Reverse Path Forwarding of Broadcast Packets", Communications of the ACM, December 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. {15} Pusateri, "Distance Vector Multicast Routing Protocol", Internet Draft -- Work in Progress, June 1996.Google ScholarGoogle Scholar

Index Terms

  1. Building shared trees using a one-to-many joining mechanism

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM SIGCOMM Computer Communication Review
            ACM SIGCOMM Computer Communication Review  Volume 27, Issue 1
            Jan. 1997
            67 pages
            ISSN:0146-4833
            DOI:10.1145/251007
            Issue’s Table of Contents

            Copyright © 1997 Authors

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 January 1997

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader