Recoverable Sequence Transmission Protocols


Authors: Ewan Tempero, Richard E. Ladner
Pages: 33
Source: GZipped PostScript (147kb); Adobe PDF (481kb)

We consider the sequence transmission problem, that is, the problem of transmitting an infinite sequence of messages (x1 x2 x3 ...) over a channel which can both lose and reorder packets. We define performance measures, ideal transmission cost and recovery cost, for protocols which 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 which has ideal transmission cost 2n, recovery cost 1, and lookahead 0.

[Up to Computer Science Technical Report Archive: Home Page]