Skip to main content
SpringerLink
Log in

Adaptive Probabilistic Search Over Unstructured Peer-to-Peer Computing Systems

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

A challenging problem that confronts unstructured peer-to-peer (P2P) computing systems is how to provide efficient support to locate desired files. This paper addresses this problem by using some quantitative information in the form of probabilistic knowledge. Two types of probabilistic knowledge are considered in this paper: overlap between topics shared in the network and coverage of topics at each individual peer. Based on the probabilistic knowledge, this paper proposes an adaptive probabilistic search algorithm that can efficiently support file locating operation in the unstructured P2P network. Then, an update algorithm is devised to keep the freshness of the probabilistic knowledge of individual peers by taking advantage of feedback from the previous user queries. Finally, some extensive experiments are conducted to evaluate the efficiency and effectiveness of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adamic, L.A., Lukose, R., Puniyani, A., Huberman, B.: Search in power–law networks. Phys. Rev. E 64, 046135, 46135–46143 (2001)

    Google Scholar 

  2. Aspnes J., Shah, G.: Skip graphs. In: Proc. of SODA, pp. 384–393, 2003

  3. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. ACM Press (1999)

  4. C. Buckley: Implementation of the smart information retrieval system. Technical Report TR-85-686, Cornell University (1985)

  5. Castro, M., Costa, M., Rowstron, A.: Should we build gnutella on a structured overlay? In: Proc. of HotNets-II, 2003

  6. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: Proc. of SIGCOMM, pp. 407–418, 2003

  7. Cholvi, V., Felber, P., Biersack, E.: Efficient search in unstructured peer-to-peer networks. Eur. Trans. Telecommun. 15(6), 535–548 (2004)

    Article  Google Scholar 

  8. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: a distributed anonymous information storage and retrieval system. In: Proc. of Int. Workshop on Design Issues in Anonymity and Unobservability, pp. 46–66, 2001

  9. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. of ICDCS, pp. 23–34, 2002

  10. Cuenca-Acuna, F.M., Nguyen, T.D.: Text-based content search and retrieval in ad hoc p2p communities. In: Proc. of Networking, pp. 220–234, 2002

  11. Dblp homepage. http://dblp.uni-trier.de/

  12. Florescu, D., Koller, D., Levy, A.: Using probabilistic information in data integration. In: Proc. of VLDB, pp. 216–225, 1997

  13. Ganesan, P., Gummadi, K., Garcia-Molina, H.: Canon in g major: designing dhts with hierarchical structure. In: Proc. of ICDCS, pp. 263–272, 2004

  14. Google directory. http://www.google.com/

  15. Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: a scalable overlay network with practical locality properties. In: Proc. of USITS, pp. 113–126, 2003

  16. Koloniari, G., Pitoura, E.: Content-based routing of path queries in peer-to-peer systems. In: Proc. of EDBT, pp. 29–47, 2004

  17. Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79–86 (1951)

    MathSciNet  Google Scholar 

  18. Loo, B.T., Hellerstein, J.M., Huebsch, R., Shenker, S., Stoica, I.: Enhancing p2p file-sharing with an internet-scale query processor. In: Proc. of VLDB, pp. 432–443, 2004

  19. Loo, B.T., Huebsch, R., Stoica, I., Hellerstein, J.M.: The case for a hybrid p2p search infrastructure. In: Proc. of IPTPS, pp. 141–150, 2004

  20. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of ICS, pp. 84–95, 2002

  21. Meng, W., Yu, C., Liu, K.-L.: Building efficient and effective metasearch engines. ACM Comp. Surv. 34(1), 48–84 (2002)

    Article  Google Scholar 

  22. Mitchell, T.M.: Machine Learning. McGraw-Hill (1997)

  23. Palmer, C.R., Steffan, J.G.: Generating network topologies that obey power law. In: Proc. of IEEE GLOBECOM, pp. 434–438, 2000

  24. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. of ACM SIGCOMM, pp. 161–172, 2001

  25. J. Risson, T. Moors: Survey of research towards robust peer-to-peer networks: search methods. Technical report, UNSW-EE-P2P-1-1, UNSW (2004)

  26. Rowstron, A., Druschel, P.: Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. IFIP/ACM Middleware, 2001

  27. Sarshar, N., Boykin, P.O., Roychowdhury, V.P.: Percolation search in power law networks: making unstructured peer-to-peer networks scalable. In: Proc. of IEEE P2P, 2004

  28. Stoica, I., Moris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM, pp. 149–160, 2001

  29. Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proc. ACM SIGCOMM, pp. 175–186, 2003

  30. Tsoumakos, D., Roussopoulos, N.: A comparison of peer-to-peer search methods. In: Proc. of WebDB, pp. 61–66, 2003

  31. Xu, L.H., Dai, C.Y., Cai, W.Y., Zhou, S.G., Zhou, A.Y.: Towards adaptive probabilistic search in unstructured p2p systems. In: Proc. of APWeb, pp. 258–268, 2004

  32. Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proc. of ICDCS, pp. 5–14, 2002

  33. Yee, W.G., Jia, D., Nguyen, L.T.: Search in peer-to-peer file-sharing system: like metasearch engines, but not really. In: Proc. of OSWIR, 2005

  34. Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve freenet performance. ACM SIGCOMM Comp. Comm. Rev. 31(1), 79 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Fudan University, Shanghai, 200433, China

    Aoying Zhou, Linhao Xu & Chenyun Dai

Authors
  1. Aoying Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linhao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chenyun Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aoying Zhou.

Additional information

This work is partially supported by the National Natural Science Foundation of China under grant No. 60496325 and 60496327 and MoE Doctorate Subject Program under project No. 20030246023, and this work was done when the first author was visiting University of California at Berkeley.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, A., Xu, L. & Dai, C. Adaptive Probabilistic Search Over Unstructured Peer-to-Peer Computing Systems. World Wide Web 9, 537–556 (2006). https://doi.org/10.1007/s11280-006-0225-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-006-0225-9

Keywords

Search

Navigation