Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Exploiting Parallelism in the Design of Peer-to-Peer Overlays
Author(s): Kolberg, Mario
Brown, Alan
Buford, John
Contact Email:
Keywords: peer-to-peer overlay
multi-destination multicast routing
distributed hash table
Peer-to-peer architecture (Computer networks)
Issue Date: Feb-2008
Date Deposited: 14-Mar-2011
Citation: Kolberg M, Brown A & Buford J (2008) Exploiting Parallelism in the Design of Peer-to-Peer Overlays. Computer Communications, 31 (3), pp. 452-463.
Abstract: Many peer-to-peer overlay operations are inherently parallel and this parallelism can be exploited by using multi-destination multicast routing, resulting in significant message reduction in the underlying network. We propose criteria for assessing when multicast routing can effectively be used, and compare multi-destination multicast and host group multicast using these criteria. We show that the assumptions underlying the Chuang-Sirbu multicast scaling law are valid in large-scale peer-to-peer overlays, and thus Chuang-Sirbu is suitable for estimating the message reduction when replacing unicast overlay messages with multicast messages. Using simulation, we evaluate message savings in two overlay algorithms when multi-destination multicast routing is used in place of unicast messages. We further describe parallelism in a range of overlay algorithms including multi-hop, variable-hop, load-balancing, random walk, and measurement overlay.
DOI Link: 10.1016/j.comcom.2007.08.019
Rights: NOTICE: this is the author’s version of a work that was accepted for publication in Computer Communications. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computer Communications, Volume 31, Issue 3, (Feb 2008), DOI: 10.1016/j.comcom.2007.08.019

Files in This Item:
File Description SizeFormat 
XCAST-BufordBrownKolberg-revised.pdfFulltext - Accepted Version710.43 kBAdobe PDFView/Open

This item is protected by original copyright

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.