Momentary recovery algorithm: A new look at the traditional problem of TCP

Jae Hyun Hwang, See Hwan Yoo, Hyuck Yoo

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover, during the recovery phase, TCP freezes congestion window size until all lost packets are recovered, and this can make recovery time much longer resulting in performance degradation. To mitigate such recovery overhead, we propose Momentary recovery algorithm that recovers packet loss without an extra recovery phase. As other TCP and variants, our algorithm also halves the congestion window size when packet drop is detected, but it performs congestion avoidance phase immediately as if loss recovery is completed. For lost packets, TCP sender transmits them along with normal packets as long as congestion window permits rather than performs fast retransmission. In this manner, we can eliminate recovery overhead efficiently and reach steady state momentarily after network congestion. Finally, we provide a simulation based study on TCP recovery behaviors and confirm that our Momentary recovery algorithm always shows better performance compared with NewReno, SACK and FACK.

Original languageEnglish
Pages (from-to)3765-3773
Number of pages9
JournalIEICE Transactions on Communications
VolumeE92-B
Issue number12
DOIs
Publication statusPublished - 2009 Dec 1

Fingerprint

Recovery
Packet loss
Throughput
Degradation

Keywords

  • Congestion control
  • Loss recovery algorithm
  • Recovery overhead
  • Transmission control protocol

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering

Cite this

Momentary recovery algorithm : A new look at the traditional problem of TCP. / Hwang, Jae Hyun; Yoo, See Hwan; Yoo, Hyuck.

In: IEICE Transactions on Communications, Vol. E92-B, No. 12, 01.12.2009, p. 3765-3773.

Research output: Contribution to journalArticle

Hwang, Jae Hyun ; Yoo, See Hwan ; Yoo, Hyuck. / Momentary recovery algorithm : A new look at the traditional problem of TCP. In: IEICE Transactions on Communications. 2009 ; Vol. E92-B, No. 12. pp. 3765-3773.
@article{25c7bab02b194233949adb5ce790bf53,
title = "Momentary recovery algorithm: A new look at the traditional problem of TCP",
abstract = "Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover, during the recovery phase, TCP freezes congestion window size until all lost packets are recovered, and this can make recovery time much longer resulting in performance degradation. To mitigate such recovery overhead, we propose Momentary recovery algorithm that recovers packet loss without an extra recovery phase. As other TCP and variants, our algorithm also halves the congestion window size when packet drop is detected, but it performs congestion avoidance phase immediately as if loss recovery is completed. For lost packets, TCP sender transmits them along with normal packets as long as congestion window permits rather than performs fast retransmission. In this manner, we can eliminate recovery overhead efficiently and reach steady state momentarily after network congestion. Finally, we provide a simulation based study on TCP recovery behaviors and confirm that our Momentary recovery algorithm always shows better performance compared with NewReno, SACK and FACK.",
keywords = "Congestion control, Loss recovery algorithm, Recovery overhead, Transmission control protocol",
author = "Hwang, {Jae Hyun} and Yoo, {See Hwan} and Hyuck Yoo",
year = "2009",
month = "12",
day = "1",
doi = "10.1587/transcom.E92.B.3765",
language = "English",
volume = "E92-B",
pages = "3765--3773",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Momentary recovery algorithm

T2 - A new look at the traditional problem of TCP

AU - Hwang, Jae Hyun

AU - Yoo, See Hwan

AU - Yoo, Hyuck

PY - 2009/12/1

Y1 - 2009/12/1

N2 - Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover, during the recovery phase, TCP freezes congestion window size until all lost packets are recovered, and this can make recovery time much longer resulting in performance degradation. To mitigate such recovery overhead, we propose Momentary recovery algorithm that recovers packet loss without an extra recovery phase. As other TCP and variants, our algorithm also halves the congestion window size when packet drop is detected, but it performs congestion avoidance phase immediately as if loss recovery is completed. For lost packets, TCP sender transmits them along with normal packets as long as congestion window permits rather than performs fast retransmission. In this manner, we can eliminate recovery overhead efficiently and reach steady state momentarily after network congestion. Finally, we provide a simulation based study on TCP recovery behaviors and confirm that our Momentary recovery algorithm always shows better performance compared with NewReno, SACK and FACK.

AB - Traditional TCP has a good congestion control strategy that adapts its sending rate in accordance with network congestion. In addition, a fast recovery algorithm can help TCP achieve better throughput by responding to temporary network congestion well. However, if multiple packet losses occur, the time to enter congestion avoidance phase would be delayed due to the long recovery time. Moreover, during the recovery phase, TCP freezes congestion window size until all lost packets are recovered, and this can make recovery time much longer resulting in performance degradation. To mitigate such recovery overhead, we propose Momentary recovery algorithm that recovers packet loss without an extra recovery phase. As other TCP and variants, our algorithm also halves the congestion window size when packet drop is detected, but it performs congestion avoidance phase immediately as if loss recovery is completed. For lost packets, TCP sender transmits them along with normal packets as long as congestion window permits rather than performs fast retransmission. In this manner, we can eliminate recovery overhead efficiently and reach steady state momentarily after network congestion. Finally, we provide a simulation based study on TCP recovery behaviors and confirm that our Momentary recovery algorithm always shows better performance compared with NewReno, SACK and FACK.

KW - Congestion control

KW - Loss recovery algorithm

KW - Recovery overhead

KW - Transmission control protocol

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

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

U2 - 10.1587/transcom.E92.B.3765

DO - 10.1587/transcom.E92.B.3765

M3 - Article

AN - SCOPUS:77952633583

VL - E92-B

SP - 3765

EP - 3773

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 12

ER -