End-to-end communication in unreliable networks

Yehuda Afek, Eli Gafni

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

Abstract

This paper addresses the problem of end-toend communication over a dynamically changing network in which the sender and the receiver are not forever separated. We present several end-to-end communication protocols whose space complexity at each node is independent of either the input length or the network size. Although the time complexity of these protocols is bounded, their communication complexity is either unbounded, or exponential if an acyclic orientation of the network is given. To bound the communication complexity of the protocols, in the absence of an acyclic orientation, we assume either knowledge of the total number of nodes in the network, or that nodes have unique ids. These bounded communication-complexity protocols thus require O(log n) space per incident link at each node. In sum, we dispel the myth that end-to-end communication protocols in a frequently changing network require "sequence numbers".

Original languageEnglish
Title of host publicationProceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, PODC 1988
PublisherAssociation for Computing Machinery
Pages131-148
Number of pages18
ISBN (Electronic)0897912772
DOIs
StatePublished - 1 Jan 1988
Externally publishedYes
Event7th Annual ACM Symposium on Principles of Distributed Computing, PODC 1988 - Toronto, Canada
Duration: 15 Aug 198817 Aug 1988

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
VolumePart F130192

Conference

Conference7th Annual ACM Symposium on Principles of Distributed Computing, PODC 1988
Country/TerritoryCanada
CityToronto
Period15/08/8817/08/88

Fingerprint

Dive into the research topics of 'End-to-end communication in unreliable networks'. Together they form a unique fingerprint.

Cite this