Reliable Communication Over Unreliable Channels
Name
MIT-LCS-TM-447.pdf
Size
8.31 MB
Format
Adobe PDF
Checksum (MD5)
b7b0c0c0f3a8edb1c15f9844f3901d7e
Author(s)
Afek, Yehuda
Attiya, Hagit
Fekete, Alan
Fischer, Michael
Lynch, Nancy A.
Mansour, Yishay
Wang, Da-Wei
Zuck, Lenore
Date Issued
October 1992
Series/Report no.
MIT-LCS-TM-447
Abstract
Layered communication protocols frequently implement a FIFO message facility on top of an unreliable non-FIFO service such as that provided by a packet-switching network. This paper investigates the possibility of implementing a reliable message layer on top of an underlying layer that can lose packets and deliver them out of order, with the additional restriction that the implementation uses only a fixed finite number of different packets. A new formalism is presented to specify communication layers and their properties, the notion of their implementation by I/O automata, and the properties of such implementations. An I/O automaton that implements a reliable layer over an unreliable layer is presented. In this implementation, the number of packets needed to deliver each succeeding message increases permanently as additional packet-loss and reordering faults occur. A proof is given that no protocol can avoid such performance degradation.
Persistent DSpace Link
