Proceedings of the 9th Workshop on Hot Topics in Dependable Systems 2013
DOI: 10.1145/2524224.2524232
|View full text |Cite
|
Sign up to set email alerts
|

Towards Byzantine fault tolerant publish/subscribe

Abstract: More than a decade of research has gone into techniques aimed at tolerating arbitrary failures in client/server interaction, using consensus based replication. These works made Byzantine fault tolerance possible [5], competitive [18], robust [7], and feasible to apply [6]. In this paper we establish a connection between the pub/sub interaction model and consensus based replication protocols, that makes the above results applicable to the design of large scale eventbased middleware. We propose a Byzantine fault… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…However, this has a more complex algorithm to handle broker failures and is less efficient in the presence of failures. Recent work [13] has also used similar tree-based overlay approach to tolerate a configurable number of arbitrary malicious failures in any part of the pub/sub system, with small divergence from traditional pub/sub specifications and forwarding schemes. This work achieves BFT based on replicated state machines using authenticated broadcast and reliable broadcast instead of Paxos.…”
Section: Related Workmentioning
confidence: 99%
“…However, this has a more complex algorithm to handle broker failures and is less efficient in the presence of failures. Recent work [13] has also used similar tree-based overlay approach to tolerate a configurable number of arbitrary malicious failures in any part of the pub/sub system, with small divergence from traditional pub/sub specifications and forwarding schemes. This work achieves BFT based on replicated state machines using authenticated broadcast and reliable broadcast instead of Paxos.…”
Section: Related Workmentioning
confidence: 99%