Optimal Resource Placement in Structured Peer-to-Peer Networks

Authors:
Weixiong Rao;Lei Chen;Ada Wai-Chee Fu;Guoren Wang
Affiliations:
The Chinese University of Hong Kong, Hong Kong;Hong Kong University of Science and Technology, Hong Kong;The Chinese University of Hong Kong, Hong Kong;Northeastern University, Shenyang
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2010

Citing 0
Cited 6

Locality-sensitive task allocation and load balancing in networked multiagent systems: Talent versus centrality

Journal of Parallel and Distributed Computing
A distributed full-text top-k document dissemination system in distributed hash tables

World Wide Web
STAIRS: Towards efficient full-text filtering and dissemination in DHT environments

The VLDB Journal — The International Journal on Very Large Data Bases
Distributed top-k full-text content dissemination

Distributed and Parallel Databases
Query Adaptation Techniques in Temporal-DHT for P2P Media Streaming Applications

International Journal of Multimedia Data Engineering & Management
Web search results caching service for structured P2P networks

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strategy, which can optimally trade off the performance gain and paid cost. The proposed resource placement strategy, with better results than existing works, can be generally applied in randomized P2P systems (Symphony) and deterministic P2P systems (e.g., Chord, Pastry, Tapestry, etc.). We apply the proposed resource placement strategy, respectively, to two novel applications: PCache (a P2P-based caching scheme) and PRing (a P2P ring structure). The simulation results as well as a real deployment on Planetlab demonstrate the effectiveness of the proposed resource placement strategy in reducing the average search cost of the whole system.