Asynchronous byzantine agreement protocols
Information and Computation
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Mercury: a scalable publish-subscribe system for internet games
NetGames '02 Proceedings of the 1st workshop on Network and system support for games
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
IEEE Transactions on Dependable and Secure Computing
Distributed Event-Based Systems
Distributed Event-Based Systems
Making Byzantine fault tolerant systems tolerate Byzantine faults
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Reliable and Highly Available Distributed Publish/Subscribe Service
SRDS '09 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems
Proceedings of the 5th European conference on Computer systems
Thialfi: a client notification service for internet-scale applications
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Total Order in Content-Based Publish/Subscribe Systems
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Opportunistic multipath forwarding in content-based publish/subscribe overlays
Proceedings of the 13th International Middleware Conference
Reconfiguration Primitives for Self-Adapting Overlays in Distributed Publish-Subscribe Systems
SASO '12 Proceedings of the 2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems
Distributed Ranked Data Dissemination in Social Networks
ICDCS '13 Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
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 event-based middleware. We propose a Byzantine fault tolerant pub/sub system, on a tree-based overlay, tolerating a configurable number of failures in any part of the system, with minimal divergence from traditional pub/sub specifications and forwarding schemes.