STARTS: Stanford proposal for Internet meta-searching
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Cluster-based language models for distributed retrieval
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
GlOSS: text-source discovery over the Internet
ACM Transactions on Database Systems (TODS)
Evaluating evaluation measure stability
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Routing Algorithms for DHTs: Some Open Questions
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Content-based retrieval in hybrid peer-to-peer networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Awarded Best Student Paper! - Pond: The OceanStore Prototype
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
An evaluation of a recursive weighing scheme for information retrieval in peer-to-peer networks
Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks
Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks
Multi-agent based peer-to-peer information retrieval systems with concurrent search sessions
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Routing Queries through a Peer-to-Peer InfoBeacons Network Using Information Retrieval Techniques
IEEE Transactions on Parallel and Distributed Systems
Adaptive indexing for content-based search in P2P systems
Data & Knowledge Engineering
PISA: Federated Search in P2P Networks with Uncooperative Peers
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Applying User Feedback and Query Learning Methods to Multiple Communities
PRIMA '09 Proceedings of the 12th International Conference on Principles of Practice in Multi-Agent Systems
PISA: A framework for integrating uncooperative peers into P2P-based federated search
Computer Communications
Federated search of text-based digital libraries in hierarchical peer-to-peer networks
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
Cluster-K+: Network topology for searching replicated data in p2p systems
Information Processing and Management: an International Journal
TRES-CORE: content-based retrieval based on the balanced tree in peer to peer systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
Hierarchical peer to peer networks 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.