The Impossibility of Implementing Reliable communication in the Face of Crashes

Fekete, Alan; Lynch, Nancy; Mansour, Yishay; Spinelli, John

doi:10.21236/ada241291

Cited by 8 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Building on earlier work by Fekete, Lynch, Mansour, and Spinelli [131], they showed that an algorithm in this model can be driven into a global state that contains any combination of reachable local states. It follows easily that problems such as leader election and mutual exclusion are impossible in this model.…”

Section: Other Problemsmentioning

confidence: 95%

“…Fekete and Lynch [130] proved that there are no headerless protocols that tolerate packet losses, so the alternating bit protocol uses the shortest possible headers. When the sender and the receiver can fail by losing the information stored in their local memories, Fekete, Lynch, Mansour and Spinelli [131] proved that no protocol can tolerate packet losses, even for an easier version of the problem where the sequence of messages can be output by the receiver in any order. For more general networks where packet losses can occur, Adler and Fich [5] proved lower bounds on the size of packet headers necessary for sequence transmission when intermediate nodes do not store information.…”

Section: Fault Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Hundreds of impossibility results for distributed computing

Fich

Ruppert

2003

Distributed Computing

124

View full text Add to dashboard Cite

We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, fault-tolerance, different communication media, and randomization. The resource bounds refer to time, space and message complexity. These results are useful in understanding the inherent difficulty of individual problems and in studying the power of different models of distributed computing. There is a strong emphasis in our presentation on explaining the wide variety of techniques that are used to obtain the results described.

show abstract

Section: Other Problemsmentioning

confidence: 95%

Section: Fault Modelsmentioning

confidence: 99%

Hundreds of impossibility results for distributed computing

Fich

Ruppert

2003

Distributed Computing

124

View full text Add to dashboard Cite

show abstract

“…A number of impossibility results consider distributed consensus in general (see [13][14][15]). In [22], the author shows that the presence of communication failures makes impossible to deterministically reach consensus (Theorem 5.1) and any r-round algorithm has probability of disagreement of at least 1 r+1 (Theorem 5.5).…”

Section: Related Workmentioning

confidence: 99%

Cooperation with disagreement correction in the presence of communication failures

Morales-Ponce

Schiller

Falcone

2014

17th International IEEE Conference on Intelligent Transportation Systems (ITSC)

View full text Add to dashboard Cite

Vehicle-to-vehicle communication is a fundamental requirement for maintaining safety standards in high-performance cooperative vehicular systems. The vehicles periodically exchange critical information among nearby vehicles and determine their maneuvers according to the information quality and the established strategies. However, wireless communication is failure prone. Thus, participants can be unaware that other participants have not received the needed information on time. This can result in conflicting (unsafe) trajectories. We present a deterministic solution that allows all participants to use a fallback strategy in the presence of communication delays. We base our solution on a timed distributed protocol. In the presence of message omission and delay failures, the protocol disagreement period is bounded by a constant (in the order of milliseconds) that may depend on the message delay in the absence of these failures. We demonstrate correctness and perform experiments to corroborate its efficiency. We explain how vehicular platooning can use the proposed solution for providing high performance while meeting the safety standards in the presence of communication failures. We believe that this work facilitates the implementation of cooperative driving systems that have to deal with inherent (communication) uncertainties. * This paper appears as a technical report [26] and as an extended abstract [23].

show abstract

“…Without statistical multiplexing, the actual state of a communication task is theoretically not confirmable [22,14,42]. With statistical multiplexing, the probability of success increases proportionally as the number of redundant computing and communication paths.…”

Section: Motivationsmentioning

confidence: 99%