AbstractWe consider the sequence transmission problem, that is, the problem of transmitting an infinite sequence of messages x_1 x_2 x_3 ... 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 x_n 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, P_{lin} that has ideal transmission cost 2n, recovery cost 1, and lookahead 0. Copyright 1995 by ACM, Inc.
The abstract is also available as a LaTeX file, a DVI file, or a PostScript file.
Categories and Subject Descriptors: C.2.2 [Computer-Communication Networks]: Network Protocols -- network protocols; F.0 [General] -- general
General Terms: Theory
Additional Key Words and Phrases: Non-FIFO, protocol, sequence transmission
Selected papers that cite this one
- Richard E. Ladner, Anthony LaMarca, and Ewan Tempero. Counting protocols for reliable end-to-end transmission. Journal of Computer and System Sciences, 56(1):96-111, February 1998.
Selected references
- Yehuda Afek, Hagit Attiya, Alan Fekete, Michael Fischer, Nancy Lynch, Yishay Mansour, Dai-Wei Wang, and Lenore Zuck. Reliable communication over unreliable channels. Journal of the ACM, 41(6):1267-1297, November 1994.
- K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM, 12(5):260-261, May 1969.
- Joseph Y. Halpern and Lenore D. Zuck. A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols. Journal of the ACM, 39(3):449-478, July 1992.
- Yishay Mansour and Baruch Schieber. The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels. Journal of the ACM, 39(4):783-799, October 1992.