Exploiting parallelism in the design of peer-to-peer overlays

Authors:
John Buford;Alan Brown;Mario Kolberg
Affiliations:
Avaya Labs Research, Lincroft, New Jersey 07738, USA;University of Stirling, Department of Computing Science and Mathematics, Stirling FK9 4LA, Scotland, UK;University of Stirling, Department of Computing Science and Mathematics, Stirling FK9 4LA, Scotland, UK
Venue:
Computer Communications
Year:
2008

Citing 22
Cited 5

Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Scaling of multicast trees: comments on the Chuang-Sirbu scaling law

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the efficiency of multicast

IEEE/ACM Transactions on Networking (TON)
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Why Johnny can't multicast: lessons about the evolution of the internet

NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Making gnutella-like P2P systems scalable

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Architecture for a Peer-to-peer Network with IP Multicasting

AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Efficient lookup on unstructured topologies

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Meridian: a lightweight network location service without virtual coordinates

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
The Essence of P2P: A Reference Architecture for Overlay Networks

P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Survey of research towards robust peer-to-peer networks: search methods

Computer Networks: The International Journal of Computer and Telecommunications Networking
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Efficient routing for peer-to-peer overlays

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Bandwidth-efficient management of DHT routing tables

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Characterizing overlay multicast networks and their costs

IEEE/ACM Transactions on Networking (TON)
An optimal overlay topology for routing peer-to-peer searches

Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management

Computer Communications
D1HT: a distributed one hop hash table

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A survey and comparison of peer-to-peer overlay network schemes

IEEE Communications Surveys & Tutorials
Study of the relationship between peer-to-peer systems and IP multicasting

IEEE Communications Magazine

Management of peer-to-peer overlays

International Journal of Internet Protocol Technology
P2P Networking and Applications

P2P Networking and Applications
Hybrid overlay multicast simulation and evaluation

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Chameleon: an adaptable 2-tier variable hop overlay

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
An XCAST multicast implementation for the OverSim simulator

CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference

Quantified Score

Hi-index	0.24

Visualization

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.