Home > Research > Publications & Outputs > On the latency efficiency of message-parsimonio...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

On the latency efficiency of message-parsimonious asynchronous atomic broadcast

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

Published

Standard

On the latency efficiency of message-parsimonious asynchronous atomic broadcast. / Dobre, D.; Ramasamy, H.V.; Suri, Neeraj.
2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE, 2007. p. 311-322.

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

Harvard

Dobre, D, Ramasamy, HV & Suri, N 2007, On the latency efficiency of message-parsimonious asynchronous atomic broadcast. in 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE, pp. 311-322. https://doi.org/10.1109/SRDS.2007.4365706

APA

Dobre, D., Ramasamy, H. V., & Suri, N. (2007). On the latency efficiency of message-parsimonious asynchronous atomic broadcast. In 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) (pp. 311-322). IEEE. https://doi.org/10.1109/SRDS.2007.4365706

Vancouver

Dobre D, Ramasamy HV, Suri N. On the latency efficiency of message-parsimonious asynchronous atomic broadcast. In 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE. 2007. p. 311-322 doi: 10.1109/SRDS.2007.4365706

Author

Dobre, D. ; Ramasamy, H.V. ; Suri, Neeraj. / On the latency efficiency of message-parsimonious asynchronous atomic broadcast. 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE, 2007. pp. 311-322

Bibtex

@inproceedings{339e63a72371401489382eb3dcb618b9,
title = "On the latency efficiency of message-parsimonious asynchronous atomic broadcast",
abstract = "We address the problem of message-parsimonious asynchronous atomic broadcast when a subset t out of n parties may exhibit Byzantine behavior. Message parsimony involves using only the optimal O(n) message exchanges per atomically delivered payload in the normal case. Message parsimony is desirable for Internet-like deployment environments in which message loss rates are non-negligible. Protocol PABC, the only previously-known message-parsimonious solution, suffered from two limitations vis-{\`a}-vis the solutions with O(n2) message complexity: more communication steps and the use of digital signatures. We present a protocol termed AMP that for the first time provides signature-free message parsimony while at the same time reducing the number of communication steps to the minimum necessary. In contrast to many previous atomic broadcast solutions, our protocol satisfies both safety and liveness in the asynchronous model. {\textcopyright} 2007 IEEE.",
keywords = "Atomic physics, Atoms, Internet protocols, Solutions, Technical presentations, Atomic broadcast, International symposium, Message exchanging, Message loss, Reliable Distributed Systems, Radio broadcasting",
author = "D. Dobre and H.V. Ramasamy and Neeraj Suri",
year = "2007",
month = oct,
day = "12",
doi = "10.1109/SRDS.2007.4365706",
language = "English",
isbn = "076952995X",
pages = "311--322",
booktitle = "2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - On the latency efficiency of message-parsimonious asynchronous atomic broadcast

AU - Dobre, D.

AU - Ramasamy, H.V.

AU - Suri, Neeraj

PY - 2007/10/12

Y1 - 2007/10/12

N2 - We address the problem of message-parsimonious asynchronous atomic broadcast when a subset t out of n parties may exhibit Byzantine behavior. Message parsimony involves using only the optimal O(n) message exchanges per atomically delivered payload in the normal case. Message parsimony is desirable for Internet-like deployment environments in which message loss rates are non-negligible. Protocol PABC, the only previously-known message-parsimonious solution, suffered from two limitations vis-à-vis the solutions with O(n2) message complexity: more communication steps and the use of digital signatures. We present a protocol termed AMP that for the first time provides signature-free message parsimony while at the same time reducing the number of communication steps to the minimum necessary. In contrast to many previous atomic broadcast solutions, our protocol satisfies both safety and liveness in the asynchronous model. © 2007 IEEE.

AB - We address the problem of message-parsimonious asynchronous atomic broadcast when a subset t out of n parties may exhibit Byzantine behavior. Message parsimony involves using only the optimal O(n) message exchanges per atomically delivered payload in the normal case. Message parsimony is desirable for Internet-like deployment environments in which message loss rates are non-negligible. Protocol PABC, the only previously-known message-parsimonious solution, suffered from two limitations vis-à-vis the solutions with O(n2) message complexity: more communication steps and the use of digital signatures. We present a protocol termed AMP that for the first time provides signature-free message parsimony while at the same time reducing the number of communication steps to the minimum necessary. In contrast to many previous atomic broadcast solutions, our protocol satisfies both safety and liveness in the asynchronous model. © 2007 IEEE.

KW - Atomic physics

KW - Atoms

KW - Internet protocols

KW - Solutions

KW - Technical presentations

KW - Atomic broadcast

KW - International symposium

KW - Message exchanging

KW - Message loss

KW - Reliable Distributed Systems

KW - Radio broadcasting

U2 - 10.1109/SRDS.2007.4365706

DO - 10.1109/SRDS.2007.4365706

M3 - Conference contribution/Paper

SN - 076952995X

SP - 311

EP - 322

BT - 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)

PB - IEEE

ER -