An adaptive timeout algorithm for retransmission across a packet switching network
Author:
Open Access
- 1 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 14 (2) , 248-255
Abstract
This paper presents and analyses a simple algorithm for setting an adaptive timeout value at a source Host for end-to-end retransmission on a packet-switched connection. The algorithm allows the recipient Host to acknowledge arriving data in either original transmission order or out-of-order. The time out at the source Host is determined from current estimates - using exponentially weighted moving averages - of the mean and variance of successive acknowledgement delays. We show that when these delays are random variables forming certain stationary or non-stationary stochastic processes, the ensuing timeout gives a near-minimum retransmission delay, subject to some specified limit on the amount of unnecessary retransmission. This property is illustrated for a simulated sequence of acknowledgement delays obtained from loop delay measurements.Keywords
This publication has 4 references indexed in Scilit:
- Information processing systems-open systems interconnection-transport protocol specificationACM SIGCOMM Computer Communication Review, 1982
- A Protocol for Packet Network IntercommunicationIEEE Transactions on Communications, 1974
- Prediction by Exponentially Weighted Moving Averages and Related MethodsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1961
- Optimal Properties of Exponentially Weighted ForecastsJournal of the American Statistical Association, 1960