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

ABSTRACT 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

  • [Show abstract] [Hide abstract]
    ABSTRACT: The publish/subscribe paradigm is known for its loosely coupled interactions and event filtering capabilities. Traditional applications using pub/sub systems require large-scale deployment and high event throughput. Thus, pub/sub has always put the emphasis on scalability and performance, to the detriment of filtering expressiveness and quality of service. The matching language is usually limited to topic-based or content-based event filtering and does not allow complex stream-based subscriptions to be expressed. Messages are delivered on a best-effort basis without any ordering or reliability guarantees. Installing additional services and event processing systems at the endpoints can overcome the limitations of pub/sub systems. However, we argue that such solutions are inefficient and put a lot of strain on the pub/sub layer itself. Therefore, the focus of this thesis is to develop integrated solutions to extend pub/sub language expression and quality of service, and demonstrate that our approach results in better performance from a holistic perspective. We first describe multiple case studies for pub/sub and identify major features which need to be supported. We then extract those requirements from our use cases and develop general solutions within the pub/sub layer. Features we have supported so far includes total order and ranked data dissemination. Finally, we conduct experiments to compare the performance of our approach to baselines which rely on end-to-end services and perform holistic evaluations to assess the impact of our work.
    Proceedings of the 9th Middleware Doctoral Symposium of the 13th ACM/IFIP/USENIX International Middleware Conference; 12/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Efficient dissemination of vehicular network applications is still a challenging objective in the area of research. Their unique characteristics impose difficulties in proposing a framework to solve the dissemination related problems. Event broker middleware provides asynchronous communication and extensive messaging in heterogeneous environments. This can be integrated with multicast routing in vehicular networks for efficient dissemination. Proposed approach aggregates content-based subscriptions in a compact data format using Binary Decision Diagram and applies Spatio-temporal Multicast Routing Protocol to extend this context from the middleware-tier to construct an optimized dynamic dissemination mesh. The dynamic multicast group is created by aggregating subscriptions, applying clustering. This work has compared the performance of K-Means and hierarchical clustering methods for clustering subscriptions to form multicast groups. Cooperation between middleware-tier and network components allows to represent fine-grained subscriptions. Simulation results support the efficiency of the proposed approach.
    Journal of Network and Computer Applications 01/2014; 39:93–103. · 1.47 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Content-based publish/subscribe (CPS) is an appealing abstraction for building scalable distributed systems, e.g., message boards, intrusion detectors, or algorithmic stock trading platforms. Recently, CPS extensions have been proposed for location-based services like vehicular networks, mobile social networking, and so on. Although current CPS middleware systems are dynamic in the way they support the joining and leaving of publishers and subscribers, they fall short in supporting subscription adaptations. These are becoming increasingly important across many CPS applications. In algorithmic high frequency trading, for instance, stock price thresholds that are of interest to a trader change rapidly, and gains directly hinge on the reaction time to relevant fluctuations rather than fixed values. In location-aware applications, a subscription is a function of the subscriber location (e.g. GPS coordinates), which inherently changes during motion. The common solution for adapting a subscription consists of a resubscription, where a new subscription is issued and the superseded one canceled. This incurs substantial overhead in CPS middleware systems, and leads to missed or duplicated events during the transition. In this article, we explore the concept of parametric subscriptions for capturing subscription adaptations. We discuss desirable and feasible guarantees for corresponding support, and propose novel algorithms for updating routing mechanisms effectively and efficiently in classic decentralized CPS broker overlay networks. Compared to resubscriptions, our algorithms significantly improve the reaction time to subscription updates without hampering throughput or latency under high update rates. We also propose and evaluate approximation techniques to detect and mitigate pathological cases of high frequency subscription oscillations, which could significantly decrease the throughput of CPS systems thereby affecting other subscribers. We analyze the benefits of our support through implementations of our algorithms in two CPS systems, and by evaluating our algorithms on two different application scenarios.
    ACM Transactions on Computer Systems (TOCS). 05/2013; 31(2).

Full-text (2 Sources)

Available from
May 22, 2014