Conference Paper

The PADRES Distributed Publish/Subscribe System.

Conference: Feature Interactions in Telecommunications and Software Systems VIII, ICFI'05, 28-30 June 2005, Leicester, UK
Source: DBLP


Work∞ow management systems are traditionally centralized, creating a single point of failure and a scalability bottleneck. In col- laboration with Cybermation, Inc., we have developed a content-based publish/subscribe platform, called PADRES, which is a distributed mid- dleware platform with features inspired by the requirements of work∞ow management and business process execution. These features constitute original additions to publish/subscribe systems and include an expres- sive subscription language, composite subscription processing, a rule- based matching and routing mechanism, historc, query-based data ac- cess, and the support for the decentralized execution of business process specifled in XML. PADRES constitutes the basis for the next genera- tion of enterprise management systems developed by Cybermation, Inc., including business process automation, monitoring, and execution appli- cations.

Download full-text


Available from: Guoli Li
  • Source
    • "In this paper we focus on systems such as Siena [20] and PADRES [24] that assume an acyclic overlay of dedicated brokers. In these systems, the information sources, or publishers , first advertise a description of the data they are about to send, and this advertisement message is flooded across the overlay and generates a spanning tree rooted at the publisher. "
    [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
    • "Our data stream language follows the traditional database SPJ queries including selection (σ), projection (π), and join (, θ ) operators. In fact, we use a subset of the PADRES SQL (PSQL)[7], an expressive SQL-based declarative language for registering continuous queries against data streams over a count-based sliding window model. Essentially, the sliding window is a snapshot of an observed finite portion of the data stream. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The limitations of traditional general-purpose processors have motivated the use of specialized hardware solutions (e.g., FPGAs) to achieve higher performance in stream processing. However, state-of-the-art hardware-only solutions have limited support to adapt to changes in the query workload. In this work, we present a reconfigurable hardware-based streaming architecture that offers the flexibility to accept new queries and to change existing ones without the need for expensive hardware reconfiguration. We introduce the Online Programmable Block (OP-Block), a "Lego-like" connectable stream processing element, for constructing a custom Flexible Query Processor (FQP), suitable to a wide range of data streaming applications, including real-time data analytics, information filtering, intrusion detection, algorithmic trading, targeted advertising, and complex event processing. Through evaluations, we conclude that updating OP-Blocks to support new queries takes on the order of nano to micro-seconds (e.g., 40 ns to realize a join operator on an OP-Block), a feature critical to support of streaming applications on FPGAs.
    Full-text · Article · May 2015
  • Source
    • "We require only storage of the standard subscription set and subscription last hop. This information already exists in the pub/sub broker through the operation of pub/sub routing (e.g., [5]). The brokers can, therefore, determine if a publication needs to be buffered to serve later requests and propagate the publication down a previously unforwarded link. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The amount of content served on social networks can overwhelm users, who must sift through the data for relevant information. To facilitate users, we develop and implement dissemination of ranked data in social networks. Although top-k computation can be performed centrally at the user, the size of the event stream can constitute a significant bottleneck. Our approach distributes the top-k computation on an overlay network to reduce the number of events flowing through. Experiments performed using real Twitter and Facebook datasets with 5K and 30K query subscriptions demonstrate that social workloads exhibit properties that are advantageous for our solution.
    Full-text · Conference Paper · Jul 2013
Show more