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

  • Authors:
  • Ken Carlberg;Jon Crowcroft

  • Affiliations:
  • Department of Computer Science, University College London, London WC 1 6BT, United Kingdom;Department of Computer Science, University College London, London WC 1 6BT, United Kingdom

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

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.