Crash resilient communication in dynamic networks

Shlomi Dolev; Jennifer L. Welch

doi:10.1007/3-540-57271-6_32

Crash resilient communication in dynamic networks

Shlomi Dolev, Jennifer L. Welch

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

1 Scopus citations

Abstract

An end-to-end data delivery protocol for dynamic communication networks is presented. The protocol uses bounded sequence numbers and can tolerate both link failures and processor crashes. Previous bounded end-to-end protocols could not tolerate crashes. A reliable data link layer is not assumed; instead the protocol is designed to work on top of the “bare” network, consisting of nodes connected by FIFO non-duplicating links that can lose messages. Our protocol retransmits messages and uses multiple paths, and thus causes messages to be duplicated and reordered. Yet the data items are delivered without omission or duplication and in FIFO fashion.

Original language	English
Title of host publication	Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings
Editors	Andre Schipe
Publisher	Springer Verlag
Pages	129-144
Number of pages	16
ISBN (Print)	9783540572718
DOIs	https://doi.org/10.1007/3-540-57271-6_32
State	Published - 1 Jan 1993
Externally published	Yes
Event	7th International Workshop on Distributed Algorithms, WDAG 1993 - Lausanne, Switzerland Duration: 27 Sep 1993 → 29 Sep 1993

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	725 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Workshop on Distributed Algorithms, WDAG 1993
Country/Territory	Switzerland
City	Lausanne
Period	27/09/93 → 29/09/93

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-57271-6_32

Cite this

Dolev, S., & Welch, J. L. (1993). Crash resilient communication in dynamic networks. In A. Schipe (Ed.), Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings (pp. 129-144). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 725 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-57271-6_32

@inproceedings{7df844db749e4cf5a9a6a759c23c46e6,

title = "Crash resilient communication in dynamic networks",

abstract = "An end-to-end data delivery protocol for dynamic communication networks is presented. The protocol uses bounded sequence numbers and can tolerate both link failures and processor crashes. Previous bounded end-to-end protocols could not tolerate crashes. A reliable data link layer is not assumed; instead the protocol is designed to work on top of the “bare” network, consisting of nodes connected by FIFO non-duplicating links that can lose messages. Our protocol retransmits messages and uses multiple paths, and thus causes messages to be duplicated and reordered. Yet the data items are delivered without omission or duplication and in FIFO fashion.",

author = "Shlomi Dolev and Welch, {Jennifer L.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1993.; 7th International Workshop on Distributed Algorithms, WDAG 1993 ; Conference date: 27-09-1993 Through 29-09-1993",

year = "1993",

month = jan,

day = "1",

doi = "10.1007/3-540-57271-6_32",

language = "English",

isbn = "9783540572718",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "129--144",

editor = "Andre Schipe",

booktitle = "Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings",

address = "Germany",

}

Dolev, S & Welch, JL 1993, Crash resilient communication in dynamic networks. in A Schipe (ed.), Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 725 LNCS, Springer Verlag, pp. 129-144, 7th International Workshop on Distributed Algorithms, WDAG 1993, Lausanne, Switzerland, 27/09/93. https://doi.org/10.1007/3-540-57271-6_32

Crash resilient communication in dynamic networks. / Dolev, Shlomi; Welch, Jennifer L.
Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings. ed. / Andre Schipe. Springer Verlag, 1993. p. 129-144 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 725 LNCS).

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

TY - GEN

T1 - Crash resilient communication in dynamic networks

AU - Dolev, Shlomi

AU - Welch, Jennifer L.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - An end-to-end data delivery protocol for dynamic communication networks is presented. The protocol uses bounded sequence numbers and can tolerate both link failures and processor crashes. Previous bounded end-to-end protocols could not tolerate crashes. A reliable data link layer is not assumed; instead the protocol is designed to work on top of the “bare” network, consisting of nodes connected by FIFO non-duplicating links that can lose messages. Our protocol retransmits messages and uses multiple paths, and thus causes messages to be duplicated and reordered. Yet the data items are delivered without omission or duplication and in FIFO fashion.

AB - An end-to-end data delivery protocol for dynamic communication networks is presented. The protocol uses bounded sequence numbers and can tolerate both link failures and processor crashes. Previous bounded end-to-end protocols could not tolerate crashes. A reliable data link layer is not assumed; instead the protocol is designed to work on top of the “bare” network, consisting of nodes connected by FIFO non-duplicating links that can lose messages. Our protocol retransmits messages and uses multiple paths, and thus causes messages to be duplicated and reordered. Yet the data items are delivered without omission or duplication and in FIFO fashion.

UR - http://www.scopus.com/inward/record.url?scp=26044462179&partnerID=8YFLogxK

U2 - 10.1007/3-540-57271-6_32

DO - 10.1007/3-540-57271-6_32

M3 - Conference contribution

AN - SCOPUS:26044462179

SN - 9783540572718

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 129

EP - 144

BT - Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings

A2 - Schipe, Andre

PB - Springer Verlag

T2 - 7th International Workshop on Distributed Algorithms, WDAG 1993

Y2 - 27 September 1993 through 29 September 1993

ER -

Crash resilient communication in dynamic networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this