Sliding window protocol with selective-repeat ARQ: performance modeling and analysis

A sliding window mechanism is well known to be a convenient way to integrate cumulative acknowledgement and flow control functions in a simple manner. Hence, widely used reliable data-transfer protocols such as TCP-SACK and RLC utilize this sliding window mechanism in conjunction with a selective-re...

Full description

Saved in:
Bibliographic Details
Published inTelecommunication systems Vol. 34; no. 3-4; pp. 167 - 180
Main Authors Ikegawa, Takashi, Takahashi, Yukio
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.04.2007
Subjects
Communications networks
Laboratories
Markov analysis
Protocol
Studies
Telecommunications systems
Wireless networks
Online AccessGet full text

Cover

More Information
Summary:A sliding window mechanism is well known to be a convenient way to integrate cumulative acknowledgement and flow control functions in a simple manner. Hence, widely used reliable data-transfer protocols such as TCP-SACK and RLC utilize this sliding window mechanism in conjunction with a selective-repeat ARQ (automatic repeat request) function, namely, the selective-repeat sliding window protocol (SR-SWP). We demonstrate that SR-SWP yields a throughput restraint effect (TORE) in particular situations when packet losses occur. We propose an analytical performance model to represent the TORE in the case of heavy traffic. Using this model, we derive explicit forms of goodput and mean resequencing delay, which are fundamental qualities of service parameters. From numerical results, we demonstrate that the impact of TORE on the performance is not negligible for high packet-loss probabilities. Furthermore, we show that the SR-SWP model exhibits the lower goodput and the smaller mean resequencing delay than those obtained from the traditional SR-ARQ protocol model. [PUBLICATION ABSTRACT]
ISSN:1018-4864
1572-9451
DOI:10.1007/s11235-007-9032-6