Building low-diameter P2P networks

In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinat...

Full description

Saved in:
Bibliographic Details
Published in:Annual Symposium on Foundations of Computer Science 2001, p.492-499
Main Authors: Pandurangan, G., Raghavan, P., Upfal, E.
Format: Article
Language:English
Subjects:
Assembly
Bandwidth
IP networks
Network servers
Network topology
Peer to peer computing
Protocols
Vehicle dynamics
Web and internet services
Web server
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and fragmentation into disconnected pieces separated by choke-points with inadequate bandwidth. The authors propose a simple scheme for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. It does so with no global knowledge of all the nodes in the network. In the most common P2P application to date (search), these properties are important.
ISSN:1552-5244
0272-5428
2168-9253
DOI:10.1109/SFCS.2001.959925