Home > Research > Publications & Outputs > One-step consensus with zero-degradation

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

One-step consensus with zero-degradation

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

One-step consensus with zero-degradation. / Dobre, D.; Suri, Neeraj.
International Conference on Dependable Systems and Networks (DSN'06). IEEE, 2006. p. 137-142.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Dobre, D & Suri, N 2006, One-step consensus with zero-degradation. in International Conference on Dependable Systems and Networks (DSN'06). IEEE, pp. 137-142. https://doi.org/10.1109/DSN.2006.55

APA

Dobre, D., & Suri, N. (2006). One-step consensus with zero-degradation. In International Conference on Dependable Systems and Networks (DSN'06) (pp. 137-142). IEEE. https://doi.org/10.1109/DSN.2006.55

Vancouver

Dobre D, Suri N. One-step consensus with zero-degradation. In International Conference on Dependable Systems and Networks (DSN'06). IEEE. 2006. p. 137-142 doi: 10.1109/DSN.2006.55

Author

Dobre, D. ; Suri, Neeraj. / One-step consensus with zero-degradation. International Conference on Dependable Systems and Networks (DSN'06). IEEE, 2006. pp. 137-142

Bibtex

@inproceedings{29bed403745541f1b90f15e0596bf96a,
title = "One-step consensus with zero-degradation",
abstract = "In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f <n/3, this is regardless of the failure detector output. A zero-degrading protocol reaches consensus in two communication steps in every stable run, i.e., when the failure detector makes no mistakes and its output does not change. We show that no leader-based consensus protocol can be simultaneously one-step and zero-degrading. We propose two approaches to circumvent the impossibility result and present corresponding consensus protocols. Further, we present an atomic broadcast protocol that has a latency of Bδ in every stable run and a latency of 2δ in case of no collisions. Finally, we evaluate its performance in a cluster of workstations. {\textcopyright} 2006 IEEE.",
keywords = "Asynchronous distributed system models, Atomic broadcast protocols, Workstations, Zero-degrading protocols, Broadcasting, Computer system recovery, Mathematical models, Network protocols, Distributed computer systems",
author = "D. Dobre and Neeraj Suri",
year = "2006",
month = jun,
day = "25",
doi = "10.1109/DSN.2006.55",
language = "English",
isbn = "0769526071",
pages = "137--142",
booktitle = "International Conference on Dependable Systems and Networks (DSN'06)",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - One-step consensus with zero-degradation

AU - Dobre, D.

AU - Suri, Neeraj

PY - 2006/6/25

Y1 - 2006/6/25

N2 - In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f <n/3, this is regardless of the failure detector output. A zero-degrading protocol reaches consensus in two communication steps in every stable run, i.e., when the failure detector makes no mistakes and its output does not change. We show that no leader-based consensus protocol can be simultaneously one-step and zero-degrading. We propose two approaches to circumvent the impossibility result and present corresponding consensus protocols. Further, we present an atomic broadcast protocol that has a latency of Bδ in every stable run and a latency of 2δ in case of no collisions. Finally, we evaluate its performance in a cluster of workstations. © 2006 IEEE.

AB - In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f <n/3, this is regardless of the failure detector output. A zero-degrading protocol reaches consensus in two communication steps in every stable run, i.e., when the failure detector makes no mistakes and its output does not change. We show that no leader-based consensus protocol can be simultaneously one-step and zero-degrading. We propose two approaches to circumvent the impossibility result and present corresponding consensus protocols. Further, we present an atomic broadcast protocol that has a latency of Bδ in every stable run and a latency of 2δ in case of no collisions. Finally, we evaluate its performance in a cluster of workstations. © 2006 IEEE.

KW - Asynchronous distributed system models

KW - Atomic broadcast protocols

KW - Workstations

KW - Zero-degrading protocols

KW - Broadcasting

KW - Computer system recovery

KW - Mathematical models

KW - Network protocols

KW - Distributed computer systems

U2 - 10.1109/DSN.2006.55

DO - 10.1109/DSN.2006.55

M3 - Conference contribution/Paper

SN - 0769526071

SP - 137

EP - 142

BT - International Conference on Dependable Systems and Networks (DSN'06)

PB - IEEE

ER -