Conference Paper

A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams.

Middleware Syst. Res. Group, Toronto Univ., Ont.
DOI: 10.1109/ICDCS.2005.8 Conference: 25th International Conference on Distributed Computing Systems (ICDCS 2005), 6-10 June 2005, Columbus, OH, USA
Source: DBLP


The challenge faced by content-based publish/subscribe systems is the ability to handle a vast amount of dynamic information with limited system resources. In current p/s systems, each subscription is processed in isolation. Neither relationships among individual subscriptions are exploited, nor historic information about subscriptions and publications is taken into account. We believe that this neglect limits overall system efficiency. In this paper, we represent subscriptions using modified binary decision diagrams (MBDs), and design an index data structure to maintain distinct predicates and manage associated Boolean variables. Our MBD-based approach can address, in a unified way, publication routing and subscription/advertisement covering and merging. We propose a novel covering algorithm based on MBDs. The algorithm can take historic information about subscription and publication populations into account and exploits relations between subscriptions. We explore merging, especially imperfect merging, and discuss an advertisement-based optimization applicable to subscription merging

Download full-text


Available from: Guoli Li
  • Source
    • "In a sense, a general subscription aggregates the interests of the more specific ones it covers. The covering optimization has many benefits including smaller routing tables, fewer subscription propagations, and faster routing decisions [15], [14]. While algorithms to maintain the correctness of contentbased routing tables when using covering optimizations have 0 500 1000 1500 2000 2500 "
    [Show abstract] [Hide abstract]
    ABSTRACT: The subscription covering optimization, whereby a general subscription quenches the forwarding of more specific ones, is a common technique to reduce network traffic and rout-ing state in content-based routing networks. Such optimizations, however, leave the system vulnerable to unsubscriptions that trigger the immediate forwarding of all the subscriptions they had previously quenched. These subscription bursts can severely congest the network, and destabilize the system. This paper presents techniques to retain much of the benefits of subscription covering while avoiding bursty subscription traffic. Heuristics are used to estimate the similarity among subscriptions, and a distributed algorithm determines the portions of a subscription propagation tree that should be preserved. Evaluations show that these mechanisms avoid subscription bursts while maintaining relatively compact routing tables.
    Full-text · Conference Paper · Aug 2015
  • Source
    • "In a distributed setting, this substrate could be supported by a publish/subscribe system [6] [5] [3]. However, for simplicity, in our centralized setting, we use a queue manager which coordinates several producer and consumer queues. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present an efficient complex event processing system tailored toward monitoring a large-scale setup of manufacturing equipment. In particular, the key challenge in the equipment monitoring is to develop an event-based system for computing complex manufacturing queries coupled with event notifications and event and query result visualization components. Furthermore, we present an experimental evaluation to validate the effectiveness of the proposed solution with respect to both query latency and throughput.
    Full-text · Conference Paper · Jan 2012
  • Source
    • "These support only equality comparisons. Li et al [6], [7] propose subscription covering, merging, and content matching algorithms based on a modified BDD representation in PADRES. XSiena [9] uses Bloom filters for subscription management and event forwarding, but as proven in [9], the complexity of subscription addition/removal is O(2 m ), where m is the number of bits required to store a condition in a subscription (i.e., filter in XSiena terminology). "
    [Show abstract] [Hide abstract]
    ABSTRACT: Content-based publish/subscribe networks (CPSNs) scale to large numbers of publishers and subscribers by having brokers summarize subscriptions from subscribers and down-stream brokers based on coverage relationships ("subsumption") between subscriptions. A broker forwards the summary to brokers which are upstream on the routes to the publishers. Current summarization and event processing mechanisms induce heavy event processing load on brokers, leading to low event throughput and high latency and further sharp performance degradation under high rates of churn, i.e., addition, deletion, or modification of subscriptions. This paper describes Beretta, a novel CPSN that leverages a simple model of typed events, enabling a succinct and uniform normalized representation of subscriptions. This in turn supports highly effective subsumption and attribute-wise split filtering with matching complexity logarithmic in the number of subscriptions, and enables the systematic introduction of parameters into subscriptions to support both parametric and structural updates. We empirically demonstrate that our techniques significantly improve throughput and latency of event propagation and reduce response times to subscription updates.
    Full-text · Conference Paper · Jul 2011
Show more