The Robustness of Content-Based Search in Hierarchical Peer to Peer Networks
M. Elena Renda* and Jamie Callan**
* I.S.T.I. - C.N.R.
and
Scuola Superiore Sant'Anna
I-56100
Pisa (PI) ITALY
NB: This work was done when the author was a Visiting Graduate Research Assistant at the Language Technologies Institute, School of Computer Science, Carnegie Mellon University.
** Language Technologies Institute
School of Computer Science - C.M.U.
Pittsburgh
PA-15213
Pennsylvania, U.S.
Contacts:
Elena.Renda_AT_iit.cnr.it
callan_AT_cs.cmu.edu
Abstract. Hierarchical Peer to Peer networks (P2P) with multiple directory services are an important architecture for large-scale file sharing due to their effectiveness and efficiency. Recent research argues that they are also an effective method of providing large-scale content-based federated search of text-based digital libraries. In both cases the directory services are critical resources that are subject to attack or failure, but the latter architecture may be particularly vulnerable because content is less likely to be replicated throughout the network.
This paper studies the robustness, effectiveness and efficiency of content-based federated search in hierarchical peer to peer networks when directory services fail unexpectedly. Several recovery methods are studied using simulations with varying failure rates. Experimental results show that quality of service and efficiency degrade gracefully as the number of directory service failures increases. Furthermore, they show that content-based search mechanisms are more resilient to failures than the match-based search techniques.
©2004 ACM 1581138741/04/0011
BibTex
@InProceedings{RendaCIKM04,
author = "Renda, M. Elena and Callan, Jamie",
title = "The Robustness of Content-Based Search in Hierarchical Peer to Peer Networks",
booktitle = "Proc.\ of the 13th Annual ACM Conference on Information and Knowledge Management (CIKM-04)",
address = "Washington D.C., U.S.A.",
year = "2004",
publisher = "{ACM} Press",
pages = "562--570"
}