Multidimensional access methods
ACM Computing Surveys (CSUR)
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
A New Tree Type Data Structure with Homogeneous Nodes Suitable for a Very Large Spatial Database
Proceedings of the Sixth International Conference on Data Engineering
Exactly-once Delivery in a Content-based Publish-Subscribe System
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Clustering Algorithms for Content-Based Publication-Subscription Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Scalable QoS-Based Event Routing in Publish-Subscribe Systems
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Achieving Bounded Delay on Message Delivery in Publish/Subscribe Systems
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Stabilizing Peer-to-Peer Spatial Filters
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
ACM Transactions on Computer Systems (TOCS)
Interest clustering techniques for efficient event routing in large-scale settings
Proceedings of the second international conference on Distributed event-based systems
Semantic peer-to-peer overlays for publish/subscribe networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Cordies: expressive event correlation in distributed systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Providing basic security mechanisms in broker-less publish/subscribe systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Event processing for large-scale distributed games
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Efficient support for multi-resolution queries in global sensor networks
Proceedings of the 5th International Conference on Communication System Software and Middleware
Moving range queries in distributed complex event processing
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Distributed spectral cluster management: a method for building dynamic publish/subscribe systems
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Efficient content-based routing with network topology inference
Proceedings of the 7th ACM international conference on Distributed event-based systems
Opportunistic spatio-temporal event processing for mobile situation awareness
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
Current distributed publish/subscribe systems assume that all participants have similar QoS requirements and equally contribute to the system's resources. However, inmany real-world applications, the message delay tolerance of individual peers may differ widely. Disseminating messages according to individual delay requirements not only allows for the satisfaction of user-specific needs but also significantly improves the utilization of the resources in a publish/subscribe system. In this paper, we propose a peer-to-peer-based approach to satisfy the individual delay requirements of subscribers in the presence of bandwidth constraints. Our approach allows subscribers to dynamically adjust the granularity of their subscriptions according to their bandwidth constraints and delay requirements. Subscribers maintain the publish/subscribe overlay in a decentralized manner by establishing connections to peers that provide messages meeting exactly their subscription granularity and complying to their delay requirements. Evaluations show that for practical workloads, the proposed system scales up to a large number of subscribers and performs robustly in a very dynamic setting.