ACM Home Page
Please provide us with feedback. Feedback
Building shared trees using a one-to-many joining mechanism
Full text PdfPdf (631 KB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 27 ,  Issue 1  (January 1997) table of contents
Pages: 5 - 11  
Year of Publication: 1997
ISSN:0146-4833
Authors
Ken Carlberg  Department of Computer Science, University College London, London WC 1 6BT, United Kingdom
Jon Crowcroft  Department of Computer Science, University College London, London WC 1 6BT, United Kingdom
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Citation Count: 20
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/251007.251008
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
[3] Moy, "OSPF Version 2", RFC 1584, March 1994.
 
4
[4] Crawley. Presentation at Montreal IETF, June 1996.
 
5
 
6
7
 
8
 
9
 
10
 
11
 
12
[12] Handley, J. Crowcroft, I. Wakeman, "Hierarchical Protocol Independent Multicast (HPIM)", white paper, October, 1995.
 
13
14
 
15
[15] Pusateri, "Distance Vector Multicast Routing Protocol", Internet Draft -- Work in Progress, June 1996.

CITED BY  20

Collaborative Colleagues:
Ken Carlberg: colleagues
Jon Crowcroft: colleagues