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.
    ICDCS2015; 08/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.
    Distributed Computing Systems (ICDCS), 2013 IEEE 33rd International Conference on; 01/2013
  • Source
    • "The above properties of the system model are common in a number of distributed content-based pub/sub system [1], [11], [6]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Total ordering is a messaging guarantee increasingly required of content-based pub/sub systems, which are traditionally focused on performance. The main challenge is the uniform ordering of streams of publications from multiple publishers within an overlay broker network to be delivered to multiple subscribers. Our solution integrates total ordering into the pub/sub logic instead of offloading it as an external service. We show that our solution is fully distributed and relies only on local broker knowledge and overlay links. We can identify and isolate specific publications and subscribers where synchronization is required: the overhead is therefore contained to the affected subscribers. Our solution remains safe under the presence of failure, where we show total order to be impossible to maintain. Our experiments demonstrate that our solution scales with the number of subscriptions and has limited overhead for the non-conflicting cases. A holistic comparison with group communication systems is offered to evaluate their relative scalability.
    Distributed Computing Systems (ICDCS), 2012 IEEE 32nd International Conference on; 06/2012
Show more