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
ICS '02 Proceedings of the 16th international conference on Supercomputing
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Looking up data in P2P systems
Communications of the ACM
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
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Analyzing the Secure Overlay Services Architecture under Intelligent DDoS Attacks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Location Awareness in Unstructured Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Characterizing the two-tier gnutella topology
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Supporting Complex Multi-Dimensional Queries in P2P Systems
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Resilient Capacity-Aware Multicast Based on Overlay Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
rStream: resilient peer-to-peer streaming with rateless codes
Proceedings of the 13th annual ACM international conference on Multimedia
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
IEEE Transactions on Parallel and Distributed Systems
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Enhancing P2P file-sharing with an internet-scale query processor
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
IEEE Transactions on Mobile Computing
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Cooperative stalking of transient nomadic resources on overlay networks
Future Generation Computer Systems
Hi-index | 0.00 |
In a hybrid peer-to-peer (P2P) system, flooding and DHT are both employed for content locating. The decision to use flooding or DHT largely depends on the population of desired data. Previous works either use local information only, or do not consider dynamic factors of P2P systems. In this paper, we propose a Popularity Adaptive Search method for Hybrid (PASH) protocol. By dynamically estimating the content popularity, PASH properly selects search methods so as to efficiently saves query traffic cost and response time. We evaluate PASH through synthetic and trace-driven simulations. The results show that PASH outperforms existing approaches and it also scales well.