Crash resilient communication in dynamic networks

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Dolev, S., & Welch, J. L. (1993). Crash resilient communication in dynamic networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 725 LNCS, pp. 129–144). Springer Verlag. https://doi.org/10.1007/3-540-57271-6_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free