The impossibility of implementing reliable communication in the face of crashes

Abstract : An important function of communication networks is to implement reliable data transfer over an unreliable underlying network. Formal specifications are given for reliable and unreliable communication layers, in terms of I/O automata. Based on these specifications, it is proved that no reliable communication protocol can tolerate crashes of the processors on which the protocol runs.

[1]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[2]  D. Belsnes.  Single-Message Communication , 1976, IEEE Trans. Commun..

[3]  David C. Walden,et al.  The ARPA Network Design Decisions , 1977, Comput. Networks.

[4]  Gérard Le Lann,et al.  Verification and Evaluation of Communication Protocols , 1978, Comput. Networks.

[5]  R. J. Cyper.  Communications architecture for distributed systems , 1978 .

[6]  Carl A. Sunshine,et al.  Connection Management in Transport Protocols , 1978, Comput. Networks.

[7]  S. Wecker,et al.  DNA: The Digital Network Architecture , 1980, IEEE Trans. Commun..

[8]  H. Zimmermann,et al.  OSI Reference Model - The ISO Model of Architecture for Open Systems Interconnection , 1980, IEEE Transactions on Communications.

[9]  Alfred V. Aho,et al.  Bounds on the size and transmission rate of communications protocols , 1982 .

[10]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[11]  Nancy A. Lynch,et al.  Data link layer: two impossibility results , 1988, PODC '88.

[12]  Adrian Segall,et al.  Reliable link initialization procedures , 1988, IEEE Trans. Commun..

[13]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[14]  John Michael Spinelli,et al.  Reliable data communication in faulty computer networks , 1989 .

[15]  Baruch Schieber,et al.  The intractability of bounded protocols for non-FIFO channels , 1989, PODC '89.

[16]  Nancy A. Lynch,et al.  A hundred impossibility proofs for distributed computing , 1989, PODC '89.

[17]  Da-Wei Wang,et al.  Tight bounds for the sequence transmission problem , 1989, PODC '89.

[18]  Richard E. Ladner,et al.  Tight bounds for weakly bounded protocols , 1990, PODC '90.

[19]  Baruch Schieber,et al.  The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels , 1992, JACM.

[20]  Nancy A. Lynch,et al.  Reliable communication over unreliable channels , 1994, JACM.