Efficient file search in non-DHT P2P networks

Authors:
Shiping Chen;Zhan Zhang;Shigang Chen;Baile Shi
Affiliations:
Network Center, University of Shanghai for Science and Technology, China;Department of Computer & Information Science & Engineering, University of Florida, USA;Department of Computer & Information Science & Engineering, University of Florida, USA;Department of Computer Science, FuDan University, China
Venue:
Computer Communications
Year:
2008

Citing 22
Cited 3

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
Search and replication in unstructured peer-to-peer networks

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Efficient Routing in Networks with Long Range Contacts

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
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
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
The impact of DHT routing geometry on resilience and proximity

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
Adaptive Probabilistic Search for Peer-to-Peer Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
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
Characterizing the two-tier gnutella topology

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Symphony: distributed hashing in a small world

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
The case for a hybrid p2p search infrastructure

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Distributed quality-of-service routing in ad hoc networks

IEEE Journal on Selected Areas in Communications

Comparison of piece-based file sharing schemes over a peer-to-peer network in a heterogeneous network environment

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Resource searching in an unstructured P2P network based on Cloning Random Walker assisted by Dominating Set

Computer Networks: The International Journal of Computer and Telecommunications Networking
Inexpensive high availability solutions for the SIP-based VoIP service

Multimedia Tools and Applications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Unstructured P2P networks dominate in practice due to their small maintenance overhead. However, the high volume of search traffic threatens its continued growth. The focus of this paper is to study how to improve the search efficiency in a non-DHT P2P network without a distributed indexing structure. We identify possible performance problems in KaZaa and Gnutella, and propose a flexible two-phase ticket-based search algorithm (TBS). In particular, the first phase is designed to reduce the search overhead and lookup delay in searching popular (highly replicated) files, and the second phase is designed to reduce the excessive duplicate messages in searching unpopular (rare) files. In addition, a random sampling solution is proposed to estimate timeout between consecutive search rounds, and a moving anchor solution is proposed to reduce duplicate visits of the same node. Moreover, we propose a ticket-based broadcast algorithm (TBA) by slightly modifying TBS, which has the significance in supporting various network functionalities. We evaluate the performance of the new techniques by both analysis and simulations, which demonstrate that the proposed solutions outperform the existing alternatives.