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.
Original language | English |
---|---|
Pages | 335-344 |
Number of pages | 10 |
DOIs | |
State | Published - 2012 |
Externally published | Yes |
Event | 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012 - Macau, China Duration: 18 Jun 2012 → 21 Jun 2012 |
Conference
Conference | 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012 |
---|---|
Country/Territory | China |
City | Macau |
Period | 18/06/12 → 21/06/12 |