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

  • Source
  • [Show abstract] [Hide abstract]
    ABSTRACT: Naval ships can achieve information superiority using publish/subscribe systems that integrate heterogeneous applications. The performance of publish/subscribe communication systems depends on the effectiveness of the event matching between events and subscribers. Semantic Web technologies, including ontology, provide a platform and tools for event matching in publish/subscribe systems. Since semantic ambiguity exists in the ontologies, however, matching performance is not ideal. To improve event matching performance, we propose an ontology-based quantitative similarity metric where the frequency of keywords is used to measure the quantitative similarity. When compared to another ontology technique for semantic matching, the approximate semantic matching method, our evaluation results show a performance improvement in precision, recall, and F-measure.
    Neurocomputing 03/2015; 152. DOI:10.1016/j.neucom.2014.11.017 · 2.01 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: As high-end systems move toward exascale sizes, a new model of scientific inquiry being developed is one in which online data analytics run concurrently with the high end simulations producing data outputs. Goals are to gain rapid insights into the ongoing scientific processes, assess their scientific validity, and/or initiate corrective or supplementary actions by launching additional computations when needed. The Flexpath system presented in this paper addresses the fundamental problem of how to structure and efficiently implement the communications between high end simulations and concurrently running online data analytics, the latter comprised of componentized dynamic services and service pipelines. Using a type-based publish/subscribe approach, Flexpath encourages diversity by permitting analytics services to differ in their computational and scaling characteristics and even in their internal execution models. Flex path uses direct and MxN connections between interacting services to reduce data movements, to allow for runtime connectivity changes to accommodate component arrivals/departures, and to support the multiple underlying communication protocols used for analytics workflows in which simulation outputs are processed by analytics services residing on the same nodes where they are generated, on the same machine, and/or on attached or remote analytics engines. This paper describes the design and implementation of Flexpath, and evaluates it with two widely used scientific applications and their associated data analytics methods.
    2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid); 05/2014

Full-text (2 Sources)

Available from
May 22, 2014