2010 IEEE 30th International Conference on Distributed Computing Systems 2010
DOI: 10.1109/icdcs.2010.86
|View full text |Cite
|
Sign up to set email alerts
|

Publisher Placement Algorithms in Content-Based Publish/Subscribe

Abstract: Abstract-Many publish/subscribe systems implement a policy for clients to join to their physically closest broker to minimize transmission delays incurred on the clients' messages. However, the amount of delay reduced by this policy is only the tip of the iceberg as messages incur queuing, matching, transmission, and scheduling delays from traveling across potentially long distances in the broker network. Additionally, the clients' impact on system load is totally neglected by such a policy. This paper propose… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 14 publications
(18 citation statements)
references
References 32 publications
0
18
0
Order By: Relevance
“…The presented model has a modular design and, thus, can easily be extended to meet new requirements. For example, a relocation of publishers as described in [27] can be mapped to a shift of publication rates from one broker to another. Many other extension in fields of the data and filter model, the physical network and the broker behavior are possible.…”
Section: Discussionmentioning
confidence: 99%
“…The presented model has a modular design and, thus, can easily be extended to meet new requirements. For example, a relocation of publishers as described in [27] can be mapped to a shift of publication rates from one broker to another. Many other extension in fields of the data and filter model, the physical network and the broker behavior are possible.…”
Section: Discussionmentioning
confidence: 99%
“…#events/sec e ∈ E is published (3) subscriptionRate e #events/sec e ∈ E is subscribed to (4) We use these aggregations to define additional key performance indicators (KPIs) for single publishers and subscribers based on the set of event types e they publish (P e ⊆ E) or subscribe to (S e ⊆ E). For example, in our scenario ITSM defines for each publisher j: the total number of subscribers that publisher j is serving across all published types of notifications (5), the relative importance or power of supply (PoS) of publisher j by providing e (6), and the power of demand (PoD) for e compared to the overall demand (7):…”
Section: B Runtime Monitoring Metricsmentioning
confidence: 99%
“…Differently from our approach, which targets runtime governance based on real-time information, ViVa relies on ex-post analysis of log files. Several approaches provide information about the runtime state [25], [19], [4] or stability [15], [5], [16], [23] of an EBS by relying on a separate aggregation system. Astrolabe [25] provides summarization based on user-defined aggregation functions, implemented via a single logical aggregation tree on top 6 https://storm.incubator.apache.org/ 7 http://www.inf.usi.ch/carzaniga/siena/ of an unstructured peer-to-peer gossip protocol.…”
Section: Related Workmentioning
confidence: 99%
“…The spectrum of aggregated information ranges from state information [45,33,5] to a quantification of system stability [26,8,27,41].…”
Section: Distributed Aggregationmentioning
confidence: 99%
“…For example, Cheung and Jacobsen [5] propose an algorithm that probabilistically traces publication messages through replies with data aggregation in order to find the best broker for connecting a new publisher. Migliavacca and Cugola [8] provide an approach for handling replies in publish/subscribe communication.…”
Section: Distributed Aggregationmentioning
confidence: 99%