Skip to main content
SpringerLink
Log in

A “cluster” based search scheme in peer-to-peer network

  • Electronics & Information Technology
  • Published:
Journal of Zhejiang University-SCIENCE A Aims and scope Submit manuscript

Abstract

This paper presents a “cluster” based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.

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

  • Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K. and Harshman, R., 1990. Indexing by latent semantic indexing.Journal of the American Society for Information Science,41(6): 391–407.

    Article  Google Scholar 

  • Druschel, P., and Rowstron, A. 2001. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer System. In Proceeings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001) W (Nov. 2001).

  • Yoid, F. P., 2000. Extending the Internet Multicast Architecture. Unpublished paper, available at http://www.aciri.org/yoid/docs/index.html.

  • Gnutella: http://gnutella.wego.com/, 2001.

  • Napster: http://www/napster, com, 2001.

  • Ratnasamy, S., Francis, P., Handley, M., Karp, R. and Shenker, S., 2001. A Scalable Content-Addressable Network. In Proc. ACM SIGCOMM 2001.

  • Stoica, I., Morris, R., Karger, D., Frans Kaashoek, M. and Hari Balakrishnan, 2001. Chord: A Scalable Peerto-Peer Lookup Service for Internet Applications.In: Proc. ACM SIGCOMM 2001.

  • TRS: http://www.trs.com.cn/product/content/200203260001. jsp, 2002

  • Zhao, B. Y., Kubiatowicz, J. and Joseph, A., 2001. Tapstry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiaotong University, 200030, Shanghai, China

    Li Zhen-wu, Shi Xu-dong & Bai Ying-cai

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

    Yang Jian

Authors
  1. Li Zhen-wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Jian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shi Xu-dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bai Ying-cai
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhen-wu, L., Jian, Y., Xu-dong, S. et al. A “cluster” based search scheme in peer-to-peer network. J. Zhejiang Univ. Sci. A 4, 549–554 (2003). https://doi.org/10.1631/jzus.2003.0549

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.2003.0549

Key words

Document code

CLC number

Search

Navigation