Journal of the ACM Bibliography

Ewan D. Tempero and Richard E. Ladner. Recoverable sequence transmission protocols. Journal of the ACM, 42(5):1059-1090, September 1995. [BibTeX entry]

We 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

Selected references


  • Journal of the ACM homepage
  • Bibliography top level
  • Journal of the ACM Author Index
  • Search the HBP database