Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Exploiting IP multicast in content-based publish-subscribe systems
IFIP/ACM International Conference on Distributed systems platforms
Router level filtering for receiver interest delivery
COMM '00 Proceedings of NGC 2000 on Networked group communication
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Channelization Problem in Large Scale Data Dissemination
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
MEDYM: match-early with dynamic multicast for content-based publish-subscribe networks
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Load Balancing Content-Based Publish/Subscribe Systems
ACM Transactions on Computer Systems (TOCS)
Clustering mechanism for content-based system in DHT-based overlay networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
MEDYM: match-early with dynamic multicast for content-based publish-subscribe networks
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Delay sensitive distributed sensor data exchange for an IoT
Proceedings of the International Workshop on Adaptive Security
| Hi-index | 0.00 |
This paper introduces new algorithms specifically designedfor content-based publication-subscription systems.These algorithms can be used to determine multicast groupswith as much commonality as possible, based on the totalityof subscribers' interests.The algorithms are based onconcepts borrowed from the literature on spatial databasesand clustering.These algorithms perform well in the contextof highly heterogeneous subscriptions, and they also scalewell.Based on concepts borrowed from the spatial databaseliterature, we develop an algorithm to match publicationsto subscribers in real-time.We also investigate the benefitsof dynamically determining whether to unicast, multicastor broadcast information about the events over the networkto the matched subscribers.We call this the distributionmethod problem.Some of these same concepts can be appliedto match publications to subscribers in real-time, andalso to determine dynamically whether to unicast, multicastor broadcast information about the events over the networkto the match subscribers.We demonstrate the quality ofour algorithms via a number of realistic simulation experiments.