Improving Fairness and Stability in Best-Effort Service: A New Congestion Control Algorithm for SACK-TCP
Summary :
In order to improve fairness and stability of TCP best-effort service we propose a new congestion control algorithm using packet loss information obtained from Selective Acknowledgments (SACK), and evaluate its effectiveness by simulation. The proposed scheme is for an environment consisting of Random Early Detection (RED) routers which drop each arriving packet with a certain probability after a threshold. The proposed mechanism adjusts the decrease in congestion window for Fast Recovery and the increase in congestion window per ACK during the congestion avoidance phase according to the number of lost packets. Simulation results show that not only the bandwidth allocation fairness is improved but also throughput deviation is markedly reduced resulting in more stable transport capability.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.11 pp.2023-2033
- Publication Date
- 1998/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Performance and Quality of Service (QoS) of Multimedia Networks)
- Category
- IP Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yukio ATSUMI, Eiichi KONDOH, Onur ALTINTA, Teruaki YOSHIDA, "Improving Fairness and Stability in Best-Effort Service: A New Congestion Control Algorithm for SACK-TCP" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 11, pp. 2023-2033, November 1998, doi: .
Abstract: In order to improve fairness and stability of TCP best-effort service we propose a new congestion control algorithm using packet loss information obtained from Selective Acknowledgments (SACK), and evaluate its effectiveness by simulation. The proposed scheme is for an environment consisting of Random Early Detection (RED) routers which drop each arriving packet with a certain probability after a threshold. The proposed mechanism adjusts the decrease in congestion window for Fast Recovery and the increase in congestion window per ACK during the congestion avoidance phase according to the number of lost packets. Simulation results show that not only the bandwidth allocation fairness is improved but also throughput deviation is markedly reduced resulting in more stable transport capability.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_11_2023/_p
Copy
@ARTICLE{e81-b_11_2023,
author={Yukio ATSUMI, Eiichi KONDOH, Onur ALTINTA, Teruaki YOSHIDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Improving Fairness and Stability in Best-Effort Service: A New Congestion Control Algorithm for SACK-TCP},
year={1998},
volume={E81-B},
number={11},
pages={2023-2033},
abstract={In order to improve fairness and stability of TCP best-effort service we propose a new congestion control algorithm using packet loss information obtained from Selective Acknowledgments (SACK), and evaluate its effectiveness by simulation. The proposed scheme is for an environment consisting of Random Early Detection (RED) routers which drop each arriving packet with a certain probability after a threshold. The proposed mechanism adjusts the decrease in congestion window for Fast Recovery and the increase in congestion window per ACK during the congestion avoidance phase according to the number of lost packets. Simulation results show that not only the bandwidth allocation fairness is improved but also throughput deviation is markedly reduced resulting in more stable transport capability.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Improving Fairness and Stability in Best-Effort Service: A New Congestion Control Algorithm for SACK-TCP
T2 - IEICE TRANSACTIONS on Communications
SP - 2023
EP - 2033
AU - Yukio ATSUMI
AU - Eiichi KONDOH
AU - Onur ALTINTA
AU - Teruaki YOSHIDA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 1998
AB - In order to improve fairness and stability of TCP best-effort service we propose a new congestion control algorithm using packet loss information obtained from Selective Acknowledgments (SACK), and evaluate its effectiveness by simulation. The proposed scheme is for an environment consisting of Random Early Detection (RED) routers which drop each arriving packet with a certain probability after a threshold. The proposed mechanism adjusts the decrease in congestion window for Fast Recovery and the increase in congestion window per ACK during the congestion avoidance phase according to the number of lost packets. Simulation results show that not only the bandwidth allocation fairness is improved but also throughput deviation is markedly reduced resulting in more stable transport capability.
ER -
English
