Article

Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks

Authors:

Hai Zhuge,

Xue Chen,

Xiaoping SunAuthors Info & Claims

WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web

Pages 882 - 883

https://doi.org/10.1145/1062745.1062779

Published: 10 May 2005 Publication History

Get Access

Abstract

To improve search efficiency and reduce unnecessary traffic in Peer-to-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential walk (P-Walk). Every peer ranks its neighbors according to searching experience. The highly ranked neighbors have higher probabilities to be queried. Simulation results show that P-Walk is not only efficient, but also robust against malicious behaviors. Furthermore, we measure peers' rank distribution and draw implications.

References

[1]

L. A. Adamic and R. M. Lukose, etc. Search in power-law networks, Phys.Rev.E, vol.64, pp.46135--46143, 2001.

Crossref

Google Scholar

[2]

A. L. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, pp.509--512, 1999.

Google Scholar

[3]

R. Bhagwan, S. Savage and G. M. Voelker Understanding availability, IPTPS, 2003.

Crossref

Google Scholar

[4]

C. Gkantsidis, M. Mihail and A. Saberi, Random walks in Peer-to-Peer networks, INFOCOM HongKong, China, 2004.

Crossref

Google Scholar

[5]

M. Mishra, Cascade: an attack resistant peer-to-peer system, the 3rd New York Metro Area Networking Workshop, 2003.

Google Scholar

[6]

M. Ripeanu and I. Foster, Mapping the Gnutella network: macroscopic properties of large-scale peer-to-peer systems, IPTPS, Cambridge, MA, 2002.

Digital Library

Google Scholar

[7]

B. Yang and H. Garcia-Molina, Efficient search in peer-to-peer networks, ICDCS, Vienna, Austria, 2002.

Digital Library

Google Scholar

[8]

H. Zhuge, The Knowledge Grid, World Scientific Co., 2004.

Digital Library

Google Scholar

[9]

H. Zhuge, China's E-Science Knowledge Grid Environment, IEEE Intelligent Systems, vol.19, pp.13--17, 2004.

Digital Library

Google Scholar

[10]

H. Zhuge, The Semantic Grid: Scientific Issues, Architecture and Methodology. Communications of the ACM, Apr. 2005.

Digital Library

Google Scholar

Cited By

View all

Khatibi ESharifi M(2020)Resource discovery mechanisms in pure unstructured peer-to-peer systems: a comprehensive surveyPeer-to-Peer Networking and Applications10.1007/s12083-020-01027-9Online publication date: 26-Nov-2020
https://doi.org/10.1007/s12083-020-01027-9
Exarchakos GAntonopoulos N(2013)Cooperative stalking of transient nomadic resources on overlay networksFuture Generation Computer Systems10.1016/j.future.2012.12.00829:6(1473-1484)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1016/j.future.2012.12.008
Sen J(2013)An Efficient, Secure and User Privacy-Preserving Search Protocol for Peer-to-Peer NetworksInternet of Things and Inter-cooperative Computational Technologies for Collective Intelligence10.1007/978-3-642-34952-2_12(279-320)Online publication date: 2013
https://doi.org/10.1007/978-3-642-34952-2_12
Show More Cited By

Index Terms

Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
1. Mathematics of computing
  1. Probability and statistics

Recommendations

Trust-based probabilistic search with the view model of peer-to-peer networks: Research Articles
Grid and Cooperative Computing (GCC2004)

The fundamental challenge confronting peer-to-peer (P2P) resource-sharing networks is to provide efficient and scalable search services in a large-scale, open and dynamic environment. However, current search mechanisms are not efficient or scalable ...
Scalable blind search and broadcasting over Distributed Hash Tables

Typical blind search algorithms in P2P networks generate a significant amount of duplicate query messages in order to increase the success rate. We present a novel framework, named Recursive Partitioning Search (RPS), for blind search over structured ...
Trustworthiness and Confidence of Peers in Peer-to-Peer (P2P) Network
AINAW '08: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops

In a peer-to-peer (P2P) overlay network, a peer process (peer) communicates with other peers and manipulates objects like databases in the peers. It is critical to obtain service information on what peers support what service. In a fully distributed, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web

May 2005

454 pages

ISBN:1595930515

DOI:10.1145/1062745

Conference Chairs:
Allan Ellis
Southern Cross University, Australia
,
Tatsuya Hagino
Keio University, Japan
,
Program Chairs:
Fred Douglis
IBM Research
,
Prabhakar Raghavan
Verity, Inc.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 May 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
376
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Khatibi ESharifi M(2020)Resource discovery mechanisms in pure unstructured peer-to-peer systems: a comprehensive surveyPeer-to-Peer Networking and Applications10.1007/s12083-020-01027-9Online publication date: 26-Nov-2020
https://doi.org/10.1007/s12083-020-01027-9
Exarchakos GAntonopoulos N(2013)Cooperative stalking of transient nomadic resources on overlay networksFuture Generation Computer Systems10.1016/j.future.2012.12.00829:6(1473-1484)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1016/j.future.2012.12.008
Sen J(2013)An Efficient, Secure and User Privacy-Preserving Search Protocol for Peer-to-Peer NetworksInternet of Things and Inter-cooperative Computational Technologies for Collective Intelligence10.1007/978-3-642-34952-2_12(279-320)Online publication date: 2013
https://doi.org/10.1007/978-3-642-34952-2_12
Sen J(2011)Secure and privacy-aware searching in peer-to-peer networksProceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security10.1007/978-3-642-28879-1_6(72-89)Online publication date: 15-Sep-2011
https://dl.acm.org/doi/10.1007/978-3-642-28879-1_6
Sen J(2010)A trust-based robust and efficient searching scheme for peer-to-peer networksProceedings of the 12th international conference on Information and communications security10.5555/1948352.1948362(77-91)Online publication date: 15-Dec-2010
https://dl.acm.org/doi/10.5555/1948352.1948362
Sen J(2010)A Trust-Based Robust and Efficient Searching Scheme for Peer-to-Peer NetworksInformation and Communications Security10.1007/978-3-642-17650-0_7(77-91)Online publication date: 2010
https://doi.org/10.1007/978-3-642-17650-0_7
Gong YYang FSu SZhang G(2009)Improve Peer Cooperation Using Social Peer-to-Peer NetworksProceedings of the 2009 First IEEE International Conference on Information Science and Engineering10.1109/ICISE.2009.657(253-257)Online publication date: 26-Dec-2009
https://dl.acm.org/doi/10.1109/ICISE.2009.657
Chen XLuo XZhang SXu Z(2009)Analysis and modeling of the semantically associated network on the WebConcurrency and Computation: Practice and Experience10.1002/cpe.153022:7(767-787)Online publication date: 15-Oct-2009
https://doi.org/10.1002/cpe.1530
Wu BKshemkalyani A(2008)Modeling message propagation in random graph networksComputer Communications10.1016/j.comcom.2008.09.00631:17(4138-4148)Online publication date: 1-Nov-2008
https://dl.acm.org/doi/10.1016/j.comcom.2008.09.006
Yuan FLiu JYin CLi JLee WSilvestri F(2007)A study of scalable search algorithm on unstructured P2P systemProceedings of the 2nd international conference on Scalable information systems10.5555/1366804.1366814(1-2)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.5555/1366804.1366814
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Trust-based probabilistic search with the view model of peer-to-peer networks: Research Articles

Scalable blind search and broadcasting over Distributed Hash Tables

Trustworthiness and Confidence of Peers in Peer-to-Peer (P2P) Network