Show simple item record

A Protocol for Scalable Application Layer Multicast

dc.contributor.authorBanerjee, Sumanen_US
dc.contributor.authorBhattacharjee, Bobbyen_US
dc.contributor.authorParthasarathy, Srinivasanen_US
dc.date.accessioned2004-05-31T21:09:34Z
dc.date.available2004-05-31T21:09:34Z
dc.date.created2001-07en_US
dc.date.issued2001-09-05en_US
dc.identifier.urihttp://hdl.handle.net/1903/524
dc.description.abstractWe describe a new application-layer multicast protocol that is specifically designed to scale to large groups. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can be used to produce a number of different data delivery trees with specific properties. On average, group members using our protocol maintain only a constant amount of state about other group members, and incur a constant amount of control overhead. We present extensive simulations of both our protocol and the Narada protocol over Internet-like topologies. Our results show that for groups of size 32 or more, we reduce control overhead by orders of magnitude, and link stress by 25%, while retaining similar end-to-end latencies and failure recovery properties.en_US
dc.format.extent904371 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4278en_US
dc.titleA Protocol for Scalable Application Layer Multicasten_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtComputer Science Department Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record