Path-aware overlay multicast

Show simple item record

dc.contributor.author Kwon, Minseok
dc.contributor.author Fahmy, Sonia
dc.date.accessioned 2009-02-06T17:38:35Z
dc.date.available 2009-02-06T17:38:35Z
dc.date.issued 2005
dc.identifier.citation Computer Networks Journal 47 (2005) 23-45
dc.identifier.issn 1389-1286
dc.identifier.uri http://hdl.handle.net/1850/8188
dc.description Article can be found on the journal homepage: http://www.elsevier.com/wps/find/journaldescription.cws_home/505606/description#description en_US
dc.description.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.
dc.language.iso en_US
dc.publisher Elsevier: Computer Networks Journal
dc.relation.ispartofseries vol. 47
dc.relation.ispartofseries no. 1
dc.relation.ispartofseries pps. 23-45
dc.title Path-aware overlay multicast
dc.type Article

Files in this item

Files Size Format View
MKwonArticle01-2005.pdf 260.6Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse