Evaluation of retransmission strategies in a local area network environment

Authors:
A. Mukherjee;L. H. Landweber;J. C. Strikwerda
Affiliations:
Computer Sciences Department, University of Wisconsin - Madison;Computer Sciences Department, University of Wisconsin - Madison;Computer Sciences Department, University of Wisconsin - Madison
Venue:
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
1989

Citing 7
Cited 1

Optimizing bulk data transfer performance: a packet train model

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The VMP network adapter board (NAB): high-performance network communication for multiprocessors

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Efficient point-to-point and point-to-multipoint selective-repeat ARQ schemes with multiple retransmissions: a throughput analysis

SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Computer networks

Computer networks
Protocols for large data transfers over local networks

SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Probability and Statistics with Reliability, Queuing and Computer Science Applications

Probability and Statistics with Reliability, Queuing and Computer Science Applications
The Analysis of Diskless Workstation Traffic on an Ethernet

The Analysis of Diskless Workstation Traffic on an Ethernet

Simultaneous analysis of flow and error control strategies with congestion-dependent errors

SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an evaluation of retransmission strategies over local area networks. Expressions are derived for the expectation and the variance of the transmission time of the go-back-n and the selective repeat protocols in the presence of errors. These are compared to the expressions for blast with full retransmission on error (BFRE) derived by Zwaenepoel [Zwa 85]. We conclude that go-back-n performs almost as well as selective repeat and is very much simpler to implement while BFRE is stable only for a limited range of messages sizes and error rates. We also present a variant of BFRE which optimally checkpoints the transmission of a large message. This is shown to overcome the instability of ordinary BFRE. It has a simple state machine and seems to take full advantage of the low error rates of local area networks. We further investigate go-back-n by generalizing the analysis to an upper layer transport protocol, which is likely to encounter among other things, variable delays due to protocol overhead, multiple connections, process switches and operating system scheduling priorities.