Efficient message ordering in dynamic networks

Idit Keidar; Danny Dolev

doi:10.1145/248052.248062

Efficient message ordering in dynamic networks

Idit Keidar^*
, Danny Dolev

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

41 Scopus citations

Abstract

We present an algorithm for totally ordering messages in the face of network partitions and site failures. The algorithm always allows a majority of connected processors in the network to make progress (i.e. to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, our algorithm always allows processors to initiate messages, even when they are not members of a connected majority component in the network. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within two communication rounds, if no failures occur during these rounds.

Original language	English
Title of host publication	PODC 1996
Subtitle of host publication	Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Publisher	ACM
Pages	68-76
Number of pages	9
ISBN (Print)	9780897918008
DOIs	https://doi.org/10.1145/248052.248062
State	Published - 1 May 1996
Event	15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 - Philadelphia, PA, USA Duration: 23 May 1996 → 26 May 1996

Conference

Conference	15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996
City	Philadelphia, PA, USA
Period	23/05/96 → 26/05/96

Access to Document

10.1145/248052.248062

Cite this

@inproceedings{29c2b4e603234e569618da7b0af41cda,

title = "Efficient message ordering in dynamic networks",

abstract = "We present an algorithm for totally ordering messages in the face of network partitions and site failures. The algorithm always allows a majority of connected processors in the network to make progress (i.e. to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, our algorithm always allows processors to initiate messages, even when they are not members of a connected majority component in the network. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within two communication rounds, if no failures occur during these rounds.",

author = "Idit Keidar and Danny Dolev",

year = "1996",

month = may,

day = "1",

doi = "10.1145/248052.248062",

language = "אנגלית",

isbn = "9780897918008",

pages = "68--76",

booktitle = "PODC 1996",

publisher = "ACM",

note = "15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 ; Conference date: 23-05-1996 Through 26-05-1996",

}

TY - GEN

T1 - Efficient message ordering in dynamic networks

AU - Keidar, Idit

AU - Dolev, Danny

PY - 1996/5/1

Y1 - 1996/5/1

N2 - We present an algorithm for totally ordering messages in the face of network partitions and site failures. The algorithm always allows a majority of connected processors in the network to make progress (i.e. to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, our algorithm always allows processors to initiate messages, even when they are not members of a connected majority component in the network. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within two communication rounds, if no failures occur during these rounds.

AB - We present an algorithm for totally ordering messages in the face of network partitions and site failures. The algorithm always allows a majority of connected processors in the network to make progress (i.e. to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, our algorithm always allows processors to initiate messages, even when they are not members of a connected majority component in the network. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within two communication rounds, if no failures occur during these rounds.

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

U2 - 10.1145/248052.248062

DO - 10.1145/248052.248062

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0029723601

SN - 9780897918008

SP - 68

EP - 76

BT - PODC 1996

PB - ACM

T2 - 15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996

Y2 - 23 May 1996 through 26 May 1996

ER -

Efficient message ordering in dynamic networks

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this