An interest-based P2P file sharing system

Authors:
Haiying Shen
Affiliations:
Department of Computer Science and Computer Engineering, University of Arkansas, Fayetteville, AR
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 8
Cited 0

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Finding Good Peers in Peer-to-Peer Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The chatty web: emergent semantics through gossiping

WWW '03 Proceedings of the 12th international conference on World Wide Web
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks

WWW '03 Proceedings of the 12th international conference on World Wide Web
Piazza: data management infrastructure for semantic web applications

WWW '03 Proceedings of the 12th international conference on World Wide Web
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Cycloid: a constant-degree and lookup-efficient P2P overlay network

Performance Evaluation - P2P computing systems
Information integration in schema-based peer-to-peer networks

CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient file query is important to the overall performance of Peer-to-Peer (P2P) file sharing systems. In this paper, we introduce an interest-based P2P file sharing system based on a structured P2P. It groups peers based on both interest and proximity. The proposed system is able to support sophisticated routing and clustering strategies based on the file attribute and topology used. Simulation results demonstrate the efficiency of the proposed system in comparison with another P2P file sharing system. It dramatically reduces the overhead and yields significant improvements in file query efficiency.