Δ-Reliable broadcast: A probabilistic measure of broadcast reliability

Patrick Th Eugster; Rachid Guerraoui; Petr Kouznetsov

Δ-Reliable broadcast: A probabilistic measure of broadcast reliability

Patrick Th Eugster
, Rachid Guerraoui
, Petr Kouznetsov

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper introduces a new probabilistic specification of reliable broadcast communication primitives, called Δ-Reliable Broadcast. This specification captures in a precise way the reliability of practical broadcast algorithms that, on the one hand, were devised with some form of reliability in mind but, on the other hand, are not considered reliable according to "traditional" reliability specifications. We illustrate the use of our specification by precisely measuring and comparing the reliability of two popular broadcast algorithms, namely Bimodal Multicast and IP Multicast In particular, we quantify how the reliability of each algorithm scales with the size of the system.

Original language	English
Pages	636-643
Number of pages	8
Publication status	Published - 1 Jun 2004
Externally published	Yes
Event	Proceedings - 24th International Conference on Distributed Computing Systems - Hachioji, Tokyo, Japan Duration: 24 Mar 2004 → 26 Mar 2004

Conference

Conference	Proceedings - 24th International Conference on Distributed Computing Systems
Country/Territory	Japan
City	Hachioji, Tokyo
Period	24/03/04 → 26/03/04

Cite this

@conference{2675f23e9fc64b9d8df674e7b2342216,

title = "Δ-Reliable broadcast: A probabilistic measure of broadcast reliability",

abstract = "This paper introduces a new probabilistic specification of reliable broadcast communication primitives, called Δ-Reliable Broadcast. This specification captures in a precise way the reliability of practical broadcast algorithms that, on the one hand, were devised with some form of reliability in mind but, on the other hand, are not considered reliable according to {"}traditional{"} reliability specifications. We illustrate the use of our specification by precisely measuring and comparing the reliability of two popular broadcast algorithms, namely Bimodal Multicast and IP Multicast In particular, we quantify how the reliability of each algorithm scales with the size of the system.",

author = "Eugster, \{Patrick Th\} and Rachid Guerraoui and Petr Kouznetsov",

year = "2004",

month = jun,

day = "1",

language = "English",

pages = "636--643",

note = "Proceedings - 24th International Conference on Distributed Computing Systems ; Conference date: 24-03-2004 Through 26-03-2004",

}

TY - CONF

T1 - Δ-Reliable broadcast

T2 - Proceedings - 24th International Conference on Distributed Computing Systems

AU - Eugster, Patrick Th

AU - Guerraoui, Rachid

AU - Kouznetsov, Petr

PY - 2004/6/1

Y1 - 2004/6/1

N2 - This paper introduces a new probabilistic specification of reliable broadcast communication primitives, called Δ-Reliable Broadcast. This specification captures in a precise way the reliability of practical broadcast algorithms that, on the one hand, were devised with some form of reliability in mind but, on the other hand, are not considered reliable according to "traditional" reliability specifications. We illustrate the use of our specification by precisely measuring and comparing the reliability of two popular broadcast algorithms, namely Bimodal Multicast and IP Multicast In particular, we quantify how the reliability of each algorithm scales with the size of the system.

AB - This paper introduces a new probabilistic specification of reliable broadcast communication primitives, called Δ-Reliable Broadcast. This specification captures in a precise way the reliability of practical broadcast algorithms that, on the one hand, were devised with some form of reliability in mind but, on the other hand, are not considered reliable according to "traditional" reliability specifications. We illustrate the use of our specification by precisely measuring and comparing the reliability of two popular broadcast algorithms, namely Bimodal Multicast and IP Multicast In particular, we quantify how the reliability of each algorithm scales with the size of the system.

UR - https://www.scopus.com/pages/publications/2442517506

M3 - Paper

AN - SCOPUS:2442517506

SP - 636

EP - 643

Y2 - 24 March 2004 through 26 March 2004

ER -

Δ-Reliable broadcast: A probabilistic measure of broadcast reliability

Abstract

Conference

Other files and links

Fingerprint

Cite this