Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs

Babay, Amy; Wagner, Emily; Dinitz, Michael; Amir, Yair

doi:10.1109/icdcs.2017.63

Cited by 17 publications

(18 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this sense, as opposed to asynchronous Byzantine reliable broadcast which delivers messages only eventually (i.e., with no predictability measures) our RTBRB primitive provides a timeliness bound: a message sent by correct processes is delivered within a known fixed duration after being broadcast. b) Real-Time Reliable Broadcast: Synchronous (or realtime) reliable broadcasts [10], [26] provide known fixed bounds on delivering broadcast messages. However they only handle fail-silent process failures and hence cannot tolerate maliciousness.…”

Section: Rtbrb Versus Existing Broadcast Primitives A) Byzantine Relimentioning

confidence: 99%

“…Jiter routes deadline constrained control messages using an overlay network created on top of multi-homed communication infrastructure. Babay et al [10] present an overlay transport service that can provide highly reliable communication while meeting stringent timeliness guarantees. Their scheme relies on an analysis of real-world network data, upon which they develop timely dissemination graphs and specify targeted redundant transmissions to timeliness and reliability.…”

Section: B Timeliness Communication Guaranteesmentioning

confidence: 99%

“…However, all above solutions [2], [9], [10], [20], [48]- [54], unlike RT-ByzCast, cannot handle malicious process behavior and hence would fail if any process is compromised. XI.…”

Section: B Timeliness Communication Guaranteesmentioning

confidence: 99%

“…For example in control systems it is very unlikely that a network link has more than two consecutive message losses. We refer readers to studies like[10],[25] that elaborate on how to estimate link burstiness.…”

mentioning

confidence: 99%

See 3 more Smart Citations

<italic>RT-ByzCast</italic>: Byzantine-Resilient Real-Time Reliable Broadcast

Kozhaya

Decouchant

Esteves-Veríssimo

2019

IEEE Trans. Comput.

View full text Add to dashboard Cite

Today's cyber-physical systems face various impediments to achieving their intended goals, namely, communication uncertainties and faults, relative to the increased integration of networked and wireless devices, hinder the synchronism needed to meet real-time deadlines. Moreover, being critical, these systems are also exposed to significant security threats. This threat combination increases the risk of physical damage. This paper addresses these problems by studying how to build the first real-time Byzantine reliable broadcast protocol (RTBRB) tolerating network uncertainties, faults, and attacks. Previous literature describes either real-time reliable broadcast protocols, or asynchronous (non real-time) Byzantine ones.We first prove that it is impossible to implement RTBRB using traditional distributed computing paradigms, e.g., where the error/failure detection mechanisms of processes are decoupled from the broadcast algorithm itself, even with the help of the most powerful failure detectors. We circumvent this impossibility by proposing RT-ByzCast, an algorithm based on aggregating digital signatures in a sliding time-window and on empowering processes with self-crashing capabilities to mask and bound losses. We show that RT-ByzCast (i) operates in real-time by proving that messages broadcast by correct processes are delivered within a known bounded delay, and (ii) is reliable by demonstrating that correct processes using our algorithm crash themselves with a negligible probability, even with message loss rates as high as 60%.

show abstract

Section: Rtbrb Versus Existing Broadcast Primitives A) Byzantine Relimentioning

confidence: 99%

Section: B Timeliness Communication Guaranteesmentioning

confidence: 99%

“…However, all above solutions [2], [9], [10], [20], [48]- [54], unlike RT-ByzCast, cannot handle malicious process behavior and hence would fail if any process is compromised. XI.…”

Section: B Timeliness Communication Guaranteesmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

<italic>RT-ByzCast</italic>: Byzantine-Resilient Real-Time Reliable Broadcast

Kozhaya

Decouchant

Esteves-Veríssimo

2019

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…For example, in [12], the 1+1 recovery scheme of the gold class is insufficient to support extremely high availability levels (e.g., five or six 9's). Different ways to improve availability include increasing the level of dedicated protection (i.e., increasing the number mutually disjoint paths), reserving adequate shareable spare capacity to restore traffic from multiple simultaneous failures (e.g., dual failure shared backup path protection [13]) and controlled flooding of traffic along dissemination graphs [14]. These approaches, however, lead to inefficient use of network resources and are also constrained by network diversity.…”

Section: Introductionmentioning

confidence: 99%

Embedded network design to support availability differentiation

2019

View full text Add to dashboard Cite

The problem of how to provide, in a cost efficient manner, high levels of availability and service differentiation in communication networks was investigated in [1-3]. The strategy adopted was to embed in the physical layer topology a high availability set of links and nodes (termed the spine). The spine enables through protection, routing and cross layer mapping, the provisioning of differentiated classes of resilience with varying levels of endto-end availability. Here we present an optimization model formulation of the spine design problem, considering link availability and the cost of upgrading link availability. The design problem seeks to minimize the cost while attaining a desired target flow availability. Extensive numerical results illustrate the benefits of modifying the availability of a subset of links of the network to implement quality of resilience classes.

show abstract