Retransmission Loss Recovery by Duplicate Acknowledgment Counting

Beomjoon Kim; Jaiyong Lee

doi:10.1109/LCOMM.2003.822525

Retransmission Loss Recovery by Duplicate Acknowledgment Counting

Beomjoon Kim, Jaiyong Lee

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

12 Citations (Scopus)

Abstract

The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. TCP always evokes RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose an algorithm called duplicate acknowledgment counting (DAC). We use a stochastic model to evaluate the performance of DAC, and compare it with TCP NewReno. Numerical results evaluated by simulations show that DAC can improve TCP loss recovery significantly in presence of random losses.

Original language	English
Pages (from-to)	69-71
Number of pages	3
Journal	IEEE Communications Letters
Volume	8
Issue number	1
DOIs	https://doi.org/10.1109/LCOMM.2003.822525
Publication status	Published - 2004 Jan

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2003.822525

Cite this

@article{ef4df78e484f4f6c83afbd6e968ba52e,

title = "Retransmission Loss Recovery by Duplicate Acknowledgment Counting",

abstract = "The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. TCP always evokes RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose an algorithm called duplicate acknowledgment counting (DAC). We use a stochastic model to evaluate the performance of DAC, and compare it with TCP NewReno. Numerical results evaluated by simulations show that DAC can improve TCP loss recovery significantly in presence of random losses.",

author = "Beomjoon Kim and Jaiyong Lee",

year = "2004",

month = jan,

doi = "10.1109/LCOMM.2003.822525",

language = "English",

volume = "8",

pages = "69--71",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Retransmission Loss Recovery by Duplicate Acknowledgment Counting

AU - Kim, Beomjoon

AU - Lee, Jaiyong

PY - 2004/1

Y1 - 2004/1

N2 - The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. TCP always evokes RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose an algorithm called duplicate acknowledgment counting (DAC). We use a stochastic model to evaluate the performance of DAC, and compare it with TCP NewReno. Numerical results evaluated by simulations show that DAC can improve TCP loss recovery significantly in presence of random losses.

AB - The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. TCP always evokes RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose an algorithm called duplicate acknowledgment counting (DAC). We use a stochastic model to evaluate the performance of DAC, and compare it with TCP NewReno. Numerical results evaluated by simulations show that DAC can improve TCP loss recovery significantly in presence of random losses.

UR - http://www.scopus.com/inward/record.url?scp=0742307425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0742307425&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2003.822525

DO - 10.1109/LCOMM.2003.822525

M3 - Article

AN - SCOPUS:0742307425

SN - 1089-7798

VL - 8

SP - 69

EP - 71

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 1

ER -

Retransmission Loss Recovery by Duplicate Acknowledgment Counting

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this