Full Text:   <2404>

CLC number: TP393

On-line Access: 

Received: 2002-11-21

Revision Accepted: 2003-01-08

Crosschecked: 0000-00-00

Cited: 0

Clicked: 4758

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2003 Vol.4 No.5 P.549-554


A "cluster" based search scheme in peer-to-peer network

Author(s):  LI Zhen-wu, YANG Jian, SHI Xu-dong, BAI Ying-cai

Affiliation(s):  Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China; more

Corresponding email(s):   li-zw@cs.sjtu.edu.cn

Key Words:  Peer-to-peer network, Cluster, Overlay, Structured feature, Request pathlength

Share this article to: More

LI Zhen-wu, YANG Jian, SHI Xu-dong, BAI Ying-cai. A "cluster" based search scheme in peer-to-peer network[J]. Journal of Zhejiang University Science A, 2003, 4(5): 549-554.

@article{title="A "cluster" based search scheme in peer-to-peer network",
author="LI Zhen-wu, YANG Jian, SHI Xu-dong, BAI Ying-cai",
journal="Journal of Zhejiang University Science A",
publisher="Zhejiang University Press & Springer",

%0 Journal Article
%T A "cluster" based search scheme in peer-to-peer network
%A LI Zhen-wu
%A YANG Jian
%A SHI Xu-dong
%A BAI Ying-cai
%J Journal of Zhejiang University SCIENCE A
%V 4
%N 5
%P 549-554
%@ 1869-1951
%D 2003
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2003.0549

T1 - A "cluster" based search scheme in peer-to-peer network
A1 - LI Zhen-wu
A1 - YANG Jian
A1 - SHI Xu-dong
A1 - BAI Ying-cai
J0 - Journal of Zhejiang University Science A
VL - 4
IS - 5
SP - 549
EP - 554
%@ 1869-1951
Y1 - 2003
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2003.0549

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.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article


[1]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.

[2]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).

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

[4]Gnutella: http://gnutella.wego.com/, 2001.

[5]Napster: http://www.napster.com, 2001.

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

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

[8]TRS: http://www.trs.com.cn/product/content/200203260001.jsp, 2002

[9]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, Univeristy of California at Berkeley, Computer Science Department.

Open peer comments: Debate/Discuss/Question/Opinion


Please provide your name, email address and a comment

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2024 Journal of Zhejiang University-SCIENCE