\input zb-basic
\input zb-ioport
\iteman{io-port 05194013}
\itemau{Ikegawa, Takashi; Takahashi, Yukio}
\itemti{Sliding window protocol with selective-repeat ARQ: performance modeling and analysis.}
\itemso{Telecommun. Syst. 34, No. 3-4, 167-180 (2007).}
\itemab
Summary: [Figure not available: see fulltext.] is a Senior Research Engineer in NTT Service Integration Laboratories, Nippon Telegraph and Telephone (NTT) Corporation. He received B.Eng. and M.Eng. degrees in fine measurements and system engineering from Nagoya Institute of Technology, Japan, in 1985 and $1987$, respectively. He joined NTT Corporation in 1987 and has been involved in network protocol standardization activity through work in the International Organization for Standardization, and in studies on network architecture by participating in the Telecommunications Information Networking Architecture Consortium (TINA-C). He is currently engaged in industry-academia collaboration activities. He is also pursuing a Ph.D. degree in Mathematical and Computing Sciences at Tokyo Institute of Technology, Japan. His research interests include performance modeling and Internet technologies and applications. He is a member of the Institute of Electronics, Information and Communication Engineers (IEICE) of Japan and the Operations Research Society of Japan. [Figure not available: see fulltext.] is a Professor of Operations Research, Department of Mathematical and Computing Sciences, Graduate School of Information Science and Engineering, Tokyo Institute of Technology, Japan. He received the B.Sci., M.Sci., and Ph.D. degrees in applied physics from Tokyo Institute of Technology. His research interests include the theory and applications of stochastic models and analyses of congestion phenomena. 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.
\itemrv{~}
\itemcc{}
\itemut{Sliding window protocol; Selective-repeat ARQ; Cumulative acknowledgement; Throughput restraint effect; TCP-SACK}
\itemli{doi:10.1007/s11235-007-9032-6}
\end