Data and computer communications (2nd ed.)
Data and computer communications (2nd ed.)
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
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
Journal of the ACM (JACM)
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
Network protocols for non-fifo channels
Network protocols for non-fifo channels
Short Headers Suffice for Communication in a DAG with Link Failures
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
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 |
We consider the sequence transmission problem, that is, the problem of transmitting an infinite sequence of messages x1x2x3… over a channel that can both lose and reorder packets. We define performance measures, ideal transmission cost and recovery cost, for protocols that solve the sequence transmission problem. Ideal transmission cost measures the number of packets needed to deliver xn when the channel is behaving ideally and recovery cost measures how long it takes, in terms of number of messages delivered, for the ideal transmission cost to take hold once the channel begins behaving ideally. We also define lookahead, which measures the number of messages the sender can be ahead of the receiver in the protocol. We show that any protocol with constant recovery cost and lookahead requires linear ideal transmission cost. We describe a protocol, Plin, that has ideal transmission cost 2n, recovery cost 1, and lookahead 0.