Thumbnail
Access Restriction
Subscribed

Author Tempero, Ewan D. ♦ Ladner, Richard E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Non-FIFO ♦ Protocol ♦ Sequence transmission
Abstract We consider the sequence transmission problem, that is, the problem of transmitting an infinite sequence of messages $\textit{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 $\textit{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 $2\textit{n},$ recovery cost 1, and lookahead 0.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 5
Page Count 32
Starting Page 1059
Ending Page 1090


Open content in new tab

   Open content in new tab
Source: ACM Digital Library