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
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
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
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Efficient Semantic-Based Content Search in P2P Network
IEEE Transactions on Knowledge and Data Engineering
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
High availability in DHTs: erasure coding vs. replication
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Making peer-to-peer keyword searching feasible using multi-level partitioning
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
An efficient resource discovery framework for pure unstructured peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Recently, Peer-to-Peer (P2P) has become a popular paradigm for building distributed systems, aiming to provide resource localization and sharing in large-scale networks. However, advanced searching for resources remains an open issue. The flooding technique used by some P2P systems is expensive in bandwidth usage, and shows a serious lack in scalability. Also, more efficient systems based on distributed hash tables (DHT) lack in query expressiveness and flexibility. This paper addresses this issue by discussing existing solutions, and proposing a novel approach to support advanced multi-keyword queries in the context of P2P systems. It extends the existing, and widely established DHT-based localization frameworks. This new approach provides an effective resource localization framework; it can substantially reduce bandwidth consumption and improve load balancing over the network. Moreover, various kinds of applications can be deployed on top of this generic framework. As a relevant use case, this paper describes a novel service discovery and management application.