Hierarchical reliable multicast: performance analysis and placement of proxies

  • Authors:
  • Athina P. Markopoulou;Fouad A. Tobagi

  • Affiliations:
  • Stanford University, Gates Bldg. 3A-339, Stanford CA;Stanford University, Gates Bldg. 3A-339, Stanford CA

  • Venue:
  • COMM '00 Proceedings of NGC 2000 on Networked group communication
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of well-known problems in Reliable Multicast (RM). The idea is that the multicast delivery tree is partitioned into subgroups that form a hierarchy rooted at the source, hence the term Hierarchical Reliable Multicast (HRM). For each subgroup, there is a designated node, the proxy, which is responsible for collecting the feedback from the subgroup and for locally re-transmitting the lost packets. The performance of any RM protocol is affected by the underlying multicast routing tree and its loss characteristics. Furthermore, the performance of the HRM approach, in particular, strongly depends on the appropriate partitioning of the tree and the selection of proxies. In this paper, we first model the HRM problem, then define and compute appropriate performance metrics and finally give insights on the optimal location of proxies.