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
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
Can Heterogeneity Make Gnutella Scalable?
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
Transparent Query Caching in Peer-to-Peer Overlay Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Distributed Caching and Adaptive Search in Multilayer P2P Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Differentiated Search in Hierarchical Peer-to-Peer Networks
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Fast and low-cost search schemes by exploiting localities in P2P networks
Journal of Parallel and Distributed Computing
An optimal overlay topology for routing peer-to-peer searches
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Quickly routing searches without having to move content
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
P2P Networking and Applications
P2P Networking and Applications
A new authentication model based on CL-PKC in resource limited P2P systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Advances In Peer-To-Peer Content Search
Journal of Signal Processing Systems
The weight-constrained maximum-density subtree problem and related problems in trees
The Journal of Supercomputing
A new search mechanism for unstructured peer-to-peer networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
A self-adaptive load balancing strategy for p2p grids
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Improving the performance of P2P networks using SPIS with Query Filtering
Journal of High Speed Networks
| Hi-index | 0.00 |
Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, heterogeneity widely exists in deployed P2P networks. Peers are different from each other in many aspects, such as bandwidth, CPU power, and storage capacity. Some approaches have been proposed to take advantage of the query forwarding heterogeneity such that the high bandwidth of powerful nodes can be fully utilized to maximize the system capacity. In this paper, we suggest using the query answering heterogeneity to directly improve the search efficiency of P2P networks. In our proposed Differentiated Search (DiffSearch) algorithm, the peers with high query answering capabilities will have higher priority to be queried. Because the query answering capabilities are extremely unbalanced among peers, a high query success rate can be achieved by querying only a small portion of a network. The search traffic is significantly reduced due to the shrunken search space. Our trace analysis and simulation show that the DiffSearch algorithm can save up to 60 percent of search traffic.