Building a scalable P2P network with small routing delay

Authors:
Shiping Chen;Yuan Li;Kaihua Rao;Lei Zhao;Tao Li;Shigang Chen
Affiliations:
Network Center, University of Shanghai for Science and Technology, Shanghai, China and Department of Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China;Department of Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China;Department of Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China;Department of Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China;Department of Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China;Department of Computer and Information Science and Engineering, University of Florida
Venue:
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Year:
2008

Citing 15
Cited 0

Accessing nearby copies of replicated objects in a distributed environment

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Mapping the Gnutella Network

IEEE Internet Computing
Analyzing peer-to-peer traffic across large networks

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Routing Algorithms for DHTs: Some Open Questions

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Routing networks for distributed hash tables

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
An analysis of internet content delivery systems

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Locality in structured peer-to-peer networks

Journal of Parallel and Distributed Computing
A Distributed Load Balancing Algorithm for Structured P2P Systems

ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Survey of research towards robust peer-to-peer networks: search methods

Computer Networks: The International Journal of Computer and Telecommunications Networking
Keyword search in DHT-based peer-to-peer networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most existing P2P networks route requests in O( kN1/k), O(log N), O(log N / log k) hops, where N is the number of participating nodes and k is an adjustable parameter. Although some can achieve O(d) -hop routing for a constant d by tuning the parameter k, the neighbor locations however become a function of N, causing considerable maintenance overhead if the user base is highly dynamic as witnessed by the deployed systems. This paper explores the design space using the simple uniformly-random neighbor selection strategy, and proposes a random peer-to-peer network that is the first of its kind to resolve requests in d hops with a chosen probability of 1 - c, where c is a constant. The number of neighbors per node is within a constant factor from the optimal complexity O(N1/d) for any network whose routing paths are bounded by d hops.