Crash resilient communication in dynamic networks

Shlomi Dolev, Jennifer L. Welch

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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 languageEnglish
Title of host publicationDistributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings
EditorsAndre Schipe
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783540572718
StatePublished - 1 Jan 1993
Externally publishedYes
Event7th International Workshop on Distributed Algorithms, WDAG 1993 - Lausanne, Switzerland
Duration: 27 Sep 199329 Sep 1993

Publication series

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


Conference7th International Workshop on Distributed Algorithms, WDAG 1993

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Crash resilient communication in dynamic networks'. Together they form a unique fingerprint.

Cite this