Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Hermes: A Distributed Event-Based Middleware Architecture
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Mechanisms for broadcast and selective broadcast
Mechanisms for broadcast and selective broadcast
Epidemic Algorithms for Reliable Content-Based Publish-Subscribe: An Evaluation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
How to Observe Real-World Events through a Distributed World Model
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Publish/subscribe in a mobile environment
Wireless Networks - Special issue: Pervasive computing and communications
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Content-Based Publish-Subscribe over Structured Overlay Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
XTreeNet: Scalable Overlay Networks for XML Content Dissemination and Querying (Synopsis)
WCW '05 Proceedings of the 10th International Workshop on Web Content Caching and Distribution
Securing publish-subscribe overlay services with EventGuard
Proceedings of the 12th ACM conference on Computer and communications security
Publish-Subscribe Grows Up: Support for Management, Visibility Control, and Heterogeneity
IEEE Internet Computing
Network-Aware Operator Placement for Stream-Processing Systems
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Constructing scalable overlays for pub-sub with many topics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
STAR: self-tuning aggregation for scalable monitoring
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Events must be complete in event processing!
Proceedings of the 2008 ACM symposium on Applied computing
Dynamic content-based channels: meeting in the middle
Proceedings of the second international conference on Distributed event-based systems
Bloom filter based routing for content-based publish/subscribe
Proceedings of the second international conference on Distributed event-based systems
Geographical distribution of subscriptions for content-based publish/subscribe in MANETs
Proceedings of the ACM/IFIP/USENIX Middleware '08 Conference Companion
Synergy: sharing-aware component composition for distributed stream processing systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Recently, decentralized publish-subscribe (pub-sub) systems have gained popularity as a scalable asynchronous messaging paradigm over wide-area networks. Most existing pub-sub systems, however, have been designed with the implicit assumption that published data is clean and accurate. As the pub-sub paradigm is incorporated in real-world applications with human participants, this assumption becomes increasingly invalid due to the inherent noise in the event stream. The noise can take many forms, including redundant, incomplete, inaccurate, and even malicious event messages. This paper explores the distributed computing issues involved in handling event streams with redundant and incomplete messages. Given a distributed broker overlay-based pub-sub system, we present our initial ideas for (1) aggregating event information scattered across multiple messages generated by different publishers and (2) eliminating redundant event messages. Key to our approach is the concept of an event-gatherer---a designated broker in the routing graph that acts as a proxy sink for all messages of a particular event---located at the graph center of the corresponding routing tree. This paper proposes a novel decentralized algorithm to find this graph center. Early results show that the proposed scheme typically reduces the message load by over 60% with less than 25% time overhead to subscribers.