Reference : PISTIS: From a Word-of-Mouth to a Gentleman’s Agreement |
E-prints/Working papers : Already available on another site | |||
Engineering, computing & technology : Computer science | |||
Security, Reliability and Trust | |||
http://hdl.handle.net/10993/44078 | |||
PISTIS: From a Word-of-Mouth to a Gentleman’s Agreement | |
English | |
Kozhaya, David [ABB Corporate Research] | |
Decouchant, Jérémie ![]() | |
Rahli, Vincent [University of Birmingham] | |
Esteves-Verissimo, Paulo [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
21-Jul-2020 | |
No | |
[en] Real-time distributed systems ; probabilistic losses ; atomic broadcast ; Byzantine resilience ; intrusion tolerance | |
[en] The accelerated digitalisation of society along with
technological evolution have extended the geographical span of cyber-physical systems. Two main threats have made the reliable and real-time control of these systems challenging: (i) uncertainty in the communication infrastructure induced by scale, openness and heterogeneity of the environment and devices; and (ii) targeted attacks maliciously worsening the impact of the above-mentioned communication uncertainties, disrupting the correctness of real-time applications. This paper addresses those challenges by showing how to build distributed protocols that provide both real-time with practical performance, and scalability in the presence of network faults and attacks. We provide a suite of real-time Byzantine protocols, which we prove correct, starting from a reliable broadcast protocol, called PISTIS, up to atomic broadcast and consensus. This suite simplifies the construction of powerful distributed and decentralized monitoring and control applications, including state-machine replication. Extensive empirical evaluations show- case PISTIS’s robustness, latency, and scalability. For example, PISTIS can withstand message loss (and delay) rates up to 40% in systems with 49 nodes and provides bounded delivery latencies in the order of a few milliseconds. | |
http://hdl.handle.net/10993/44078 | |
https://arxiv.org/abs/2007.10958 |
File(s) associated to this reference | ||||||||||||||
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.