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
Search and replication in unstructured peer-to-peer networks
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Looking up data in P2P systems
Communications of the ACM
Complex Queries in DHT-based Peer-to-Peer Networks
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
A Hierarchical Architecture for Real-Time Search in Peer-to-Peer Networks
PDCAT '09 Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we propose a new file search scheme for a three-tier Peer-to-Peer (P2P) architecture. The proposed scheme consists of two parts. The first part determines a way of associating files held by each peer in the bottom layer to subservers in the middle layer, where each subserver plays the same role with the (centralized) server in conventional search engines such as Google and Yahoo!. The second part provides a way of forwarding a query received by the central server in the top layer to an appropriate subserver relevant to the query. The proposed scheme is based on the notion of “tags”, and a technique of priority sequence of tags is introduced to realize a quick forwarding of queries. The result of performance evaluation indicates that the number of tags which must be examined in forwarding a given query is bounded by a small constant.