Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Data link layer: two impossibility results
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Computer networks
Tight bounds for the sequence transmission problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight bounds for weakly bounded protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Reliable communication over unreliable channels
Journal of the ACM (JACM)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
The impossibility of implementing reliable communication in the face of crashes
Journal of the ACM (JACM)
Reliable communication over unreliable channels
Journal of the ACM (JACM)
Recoverable sequence transmission protocols
Journal of the ACM (JACM)
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Hi-index | 0.00 |
The efficiency of data-link protocols for reliable transmission of a sequence of messages over non-FIFO physical channels is discussed. The transmission has to be on-line; i.e., a message cannot be accessed by the transmitting station before the preceding message has been received. Three resources are considered: The number of packets that have to be sent, the number of headers, and the amount of space required by the protocol. Three lower bounds are proved. First, the space required by any protocol for delivering n messages that uses less than n headers cannot be bounded by any function of n. Second, the number of packets that have to be sent by any protocol that uses a fixed number of headers in order to deliver a message is linear in the number of packets that are delayed on the channel at the time the message is sent. Finally, the notion of a probabilistic physical channel, in which a packet can be delayed on the channel with probability q, is introduced. An exponential lower bound, with overwhelming probability, is proved on the number of packets that have to be sent by any data-link protocol using a fixed number of headers when it is implemented over a probabilistic physical channel.