Forwarding in a content-based network

Carzaniga, Antonio; Wolf, Alexander L.

doi:10.1145/863955.863975

Cited by 201 publications

(184 citation statements)

References 23 publications

Supporting

Mentioning

180

Contrasting

Unclassified

Order By: Relevance

“…Since the content matching operation is performed at every node along the path from publisher broker to subscribers, matching time has a significant effect on the speed of publication dissemination. Several efficient matching techniques have been proposed in the literature to reduce matching time [8,9].…”

Section: Subscription and Publication Routingmentioning

confidence: 99%

Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems

et al. 2008

View full text Add to dashboard Cite

Abstract. In this paper we address the problem of subsumption checking for subscriptions in pub/sub systems. We develop a novel approach based on negative space representation for subsumption checking and provide efficient algorithms for subscription forwarding in a dynamic pub/ sub environment. We then provide heuristics for approximate subsumption checking that greatly enhance the performance without compromising the correct execution of the system and only adding incremental cost in terms of extra computation in brokers. We illustrate the advantages of this novel approach by carrying out extensive experimentation.

show abstract

Section: Subscription and Publication Routingmentioning

confidence: 99%

Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems

et al. 2008

View full text Add to dashboard Cite

show abstract

“…They have also designed efficient event forwarding algorithms in [8]. Many other distributed pub-sub systems follow the CBF approach.…”

Section: Content-based Forwarding (Cbf)mentioning

confidence: 99%

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Cao

Singh

2005

Middleware 2005

View full text Add to dashboard Cite

Abstract. Design of distributed architectures for content-based publishsubscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM -Match-Early with DYnamic Multicast. MEDYM follows the End-to-End distributed system design principle. It decouples a pub-sub service into two functionalities: complex, application-specific matching at network edge, and simple, generic multicast routing in the network. This architecture achieves low computation cost in event matching and high network efficiency and flexibility in event routing. For higher scalability, we describe a novel approach to extend MEDYM to a hierarchy structure called H-MEDYM, which effectively balances the trade-off between event delivery efficiency and server states maintenance. We evaluate MEDYM and H-MEDYM using detailed simulations and real-world experiments, and compare them with major existing design approaches. Results show that MEDYM and H-MEDYM achieve high event delivery efficiency and system scalability, and their advantages are most prominent when user subscriptions are highly selective and diversified.

show abstract

“…Notoriously, content-based dispatching mechanisms must be efficient because notification sets, i.e. the set of subscribers that must be notified for the event, can be order of magnitude larger than in topic-based EN [6,18]. A main advantage of content-based EN is that publishers and subscribers do not have to share any a priori knowledge about the topics.…”

Section: Introductionmentioning

confidence: 99%

Coordination Via Types in an Event-Based Framework

Ferrari

Guanciale

Strollo

et al. 2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a novel approach to service choreography through a typed process calculus that features an event notification paradigm for coordinating distributed components (e.g., services). Basically, the type system expresses coordination policies for handling the events spawn in a network so that distributed components react to events when the type of their public interface is "compatible" with (the policies expressed by) the types of signals.Remarkably, the type system can naturally handle multi-party sessions, as shown in the formalisation of the OpenID protocol which requires multi-party sessions for handling user identities.

show abstract

Forwarding in a content-based network

Cited by 201 publications

References 23 publications

Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems

Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Coordination Via Types in an Event-Based Framework

Contact Info

Product

Resources

About