ACM Home Page
Please provide us with feedback. Feedback
A local search mechanism for peer-to-peer networks
Full text PdfPdf (239 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the eleventh international conference on Information and knowledge management table of contents
McLean, Virginia, USA
SESSION: XML schemas: integration and translation table of contents
Pages: 300 - 307  
Year of Publication: 2002
ISBN:1-58113-492-4
Authors
Vana Kalogeraki  Hewlett-Packard Labs, Palo Alto, CA
Dimitrios Gunopulos  Univ. of California, Riverside
D. Zeinalipour-Yazti  Univ. of California, Riverside
Sponsors
SIGMIS: ACM Special Interest Group on Management Information Systems
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 124,   Citation Count: 40
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/584792.584842
What is a DOI?

ABSTRACT

One important problem in peer-to-peer (P2P) networks is searching and retrieving the correct information. However, existing searching mechanisms in pure peer-to-peer networks are inefficient due to the decentralized nature of such networks. We propose two mechanisms for information retrieval in pure peer-to-peer networks. The first, the modified Breadth-First Search (BFS) mechanism, is an extension of the current Gnuttela protocol, allows searching with keywords, and is designed to minimize the number of messages that are needed to search the network. The second, the Intelligent Search mechanism, uses the past behavior of the P2P network to further improve the scalability of the search procedure. In this algorithm, each peer autonomously decides which of its peers are most likely to answer a given query. The algorithm is entirely distributed, and therefore scales well with the size of the network. We implemented our mechanisms as middleware platforms. To show the advantages of our mechanisms we present experimental results using the middleware implementation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. A. Adamic, R. M. Lukose, A. R. Puniyani and B. A. Huberman. Search in power-law networks. Phys. Rev. E, 64 46135 (2001).
 
2
J. Breese, D. Heckerman, and C. Kadie. Empirical Analysis of Predictive Algorithms for Collaborative Filtering. Proc. of the Fourteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-98). San Francisco, CA, pp. 43--52
 
3
J. Callan, A.L. Powell, J.C. French, and M. Connell. The effects of query-based sampling on automatic database selection algorithms. Technical Report IR-181, Center for Intelligent Information Retrieval, Department of Computer Science, University of Massachusetts.
 
4
 
5
Clip2. www.clip2.net
 
6
 
7
 
8
Freenet, http://freenet.sourceforge.net
9
 
10
Gnutella, http://gnutella.wego.com.
 
11
 
12
Kazaa, http://www.kazaa.com
 
13
H. Lieberman, N. Van Dyke, and A. Vivacqua. Let's Browse: A Collaborative Web Browsing Agent. MIT Media Lab Tech Report.
 
14
Z. Lu and K. S. McKinley. The Effect of Collection Organization and Query Locality on Information Retrieval System Performance and Design. Book chapter in Advances in Information Retrieval, Kluwer, New York, 2000. Bruce Croft, Editor.
15
 
16
Napster, http://www.napster.com.
17
 
18
REUTERS-21578 dataset. http://www.research.att.com/~lewis
19
 
20
 
21
22
23
 
24
H. Zhang, A. Goel, R. Govindan. Using the Small-World Model to Improve Freenet Performance. Proc. of IEEE Infocom, 2002.

CITED BY  40

Collaborative Colleagues:
Vana Kalogeraki: colleagues
Dimitrios Gunopulos: colleagues
D. Zeinalipour-Yazti: colleagues