Path-aware overlay multicast

  • Authors:
  • Minseok Kwon;Sonia Fahmy

  • Affiliations:
  • Department of Computer Sciences, Purdue University, 250 N. University Street, West Lafayette, IN 47907-2066, USA;Department of Computer Sciences, Purdue University, 250 N. University Street, West Lafayette, IN 47907-2066, USA

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate a heuristic application-level (overlay) multicast approach, which we refer to as Topology Aware Grouping (TAG). TAG exploits underlying network topology data to construct overlay multicast networks. Specifically, TAG uses the overlap among routes from the source to group members to construct an efficient overlay network in a distributed, low-overhead manner. We can easily integrate TAG with delay and bandwidth bounds to construct overlays that satisfy application requirements. We study the properties of TAG, and quantify its economies of scale factor, compared to unicast and IP multicast. In addition, we compare TAG with delay-first and bandwidth-first Narada/End System Multicast (ESM) in a variety of simulation configurations. We also implement and experiment with TAG on the PlanetLab wide-area platform. Our results demonstrate the effectiveness of our heuristic in reducing delays and duplicate packets, especially when underlying routes are of high quality.