Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
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
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Using Space-Filling Curves for Multi-dimensional Indexing
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
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
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
A peer-to-peer approach to content-based publish/subscribe
Proceedings of the 2nd international workshop on Distributed event-based systems
Peer-to-peer overlay broker networks in an event-based middleware
Proceedings of the 2nd international workshop on Distributed event-based systems
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
A Scalable P2P Platform for the Knowledge Grid
IEEE Transactions on Knowledge and Data Engineering
Internet scale string attribute publish/subscribe data networks
Proceedings of the 14th ACM international conference on Information and knowledge management
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A Geographical Observation System based on P2P Agents
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Towards an architecture for extreme P2P applications
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Quasar: a probabilistic publish-subscribe system for social networks
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Content-based publish/subscribe using distributed R-trees
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
P2P is a popular networking paradigm in today's internet. As such, many research and development efforts are geared toward services that can be useful to the users of P2P networks. This paper is focused on the content-based publish/subscribe service and our problem is to devise an efficient mechanism that enables this service in any given P2P network of cooperative nodes. Most techniques require some overlay structure added on top of the network. We propose an efficient solution called PUB-2-SUB which works with any unstructured network topology. In addition, multiple independent publish/subscribe applications can run simultaneously on a single instance of PUB-2-SUB. The proposed technique is based on two key components: the virtualization component and the indexing component. The virtualization component assigns to each node a unique binary string virtual address and, accordingly, a unique zone partitioned from the universe of binary strings. The indexing component hashes queries and publications to binary strings and, based on their overlapping with the node zones, chooses subscription and notification paths appropriately and deterministically. PUB-2-SUB works best for P2P-based cooperative networks such as data grid networks and institutional collaborative networks. Our theoretical findings are complemented by a simulation-based evaluation.