Path-aware overlay multicast

Get BibTex-formatted data

Author

Minseok Kwon, Sonia Fahmy

Entry type

article

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.

Date

2005 – 01 – 14

URL

http://www.sciencedirect.com/s ... da0f2989cc290c4ad35a5114f

Journal

Computer Networks

Key alpha

Fahmy

Pages

23-45

Publisher

Elsevier Science

Volume

Affiliation

Purdue University

Publication Date

2005-01-14

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ Fahmy,
	title = "Path-aware overlay multicast",
	author = "Minseok Kwon, Sonia Fahmy",
	year = "2005",
	month = "01",
	journal = "Computer Networks",
	pages = "23-45",
	publisher = "Elsevier Science",
	volume = "47",
	day = "14",
	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.",
	affiliation = "Purdue University",
	url = "http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VRG-4D2XB3X-1&_user=29441&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000003858&_version=1&_urlVersion=0&_userid=29441&md5=8d6cf95da0f2989cc290c4ad35a5114f",
}