Home > Research > Publications & Outputs > Optimal congestion control of TCP flows for int...
View graph of relations

Optimal congestion control of TCP flows for internet routers

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Optimal congestion control of TCP flows for internet routers. / Avrachenkov, K.; Ayesta, U.; Doncel, J. et al.
In: ACM SIGMETRICS Performance Evaluation Review, Vol. 40, No. 3, 04.01.2012, p. 62-64.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Avrachenkov, K, Ayesta, U, Doncel, J & Jacko, P 2012, 'Optimal congestion control of TCP flows for internet routers', ACM SIGMETRICS Performance Evaluation Review, vol. 40, no. 3, pp. 62-64. https://doi.org/10.1145/2425248

APA

Avrachenkov, K., Ayesta, U., Doncel, J., & Jacko, P. (2012). Optimal congestion control of TCP flows for internet routers. ACM SIGMETRICS Performance Evaluation Review, 40(3), 62-64. https://doi.org/10.1145/2425248

Vancouver

Avrachenkov K, Ayesta U, Doncel J, Jacko P. Optimal congestion control of TCP flows for internet routers. ACM SIGMETRICS Performance Evaluation Review. 2012 Jan 4;40(3):62-64. doi: 10.1145/2425248

Author

Avrachenkov, K. ; Ayesta, U. ; Doncel, J. et al. / Optimal congestion control of TCP flows for internet routers. In: ACM SIGMETRICS Performance Evaluation Review. 2012 ; Vol. 40, No. 3. pp. 62-64.

Bibtex

@article{d358f6055d5d4763bacb476cf59743d1,
title = "Optimal congestion control of TCP flows for internet routers",
abstract = "In this work we address the problem of fast and fair transmission of ows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a TCP source and a bottleneck queue with the objective of designing optimal packet admission controls in the bottleneck queue. We focus on the relaxed version of the problem obtained by relaxing the fixed buffer capacity constraint that must be satisfied at all time epoch. The relaxation allows us to reduce the multi-ow problem into a family of single-ow problems, for which we can analyze both theoretically and numerically the existence of optimal control policies of special structure. In particular, we show that for a variety of parameters, TCP ows can be optimally controlled in routers by so-called index policies. We have implemented index policies in Network Simulator-3 (NS-3) and compared its performance with DropTail and RED buffers. The simulation results show that the index policy has several desirable properties with respect to fairness and efficiency.",
author = "K. Avrachenkov and U. Ayesta and J. Doncel and P. Jacko",
year = "2012",
month = jan,
day = "4",
doi = "10.1145/2425248",
language = "English",
volume = "40",
pages = "62--64",
journal = "ACM SIGMETRICS Performance Evaluation Review",
issn = "0163-5999",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

RIS

TY - JOUR

T1 - Optimal congestion control of TCP flows for internet routers

AU - Avrachenkov, K.

AU - Ayesta, U.

AU - Doncel, J.

AU - Jacko, P.

PY - 2012/1/4

Y1 - 2012/1/4

N2 - In this work we address the problem of fast and fair transmission of ows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a TCP source and a bottleneck queue with the objective of designing optimal packet admission controls in the bottleneck queue. We focus on the relaxed version of the problem obtained by relaxing the fixed buffer capacity constraint that must be satisfied at all time epoch. The relaxation allows us to reduce the multi-ow problem into a family of single-ow problems, for which we can analyze both theoretically and numerically the existence of optimal control policies of special structure. In particular, we show that for a variety of parameters, TCP ows can be optimally controlled in routers by so-called index policies. We have implemented index policies in Network Simulator-3 (NS-3) and compared its performance with DropTail and RED buffers. The simulation results show that the index policy has several desirable properties with respect to fairness and efficiency.

AB - In this work we address the problem of fast and fair transmission of ows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a TCP source and a bottleneck queue with the objective of designing optimal packet admission controls in the bottleneck queue. We focus on the relaxed version of the problem obtained by relaxing the fixed buffer capacity constraint that must be satisfied at all time epoch. The relaxation allows us to reduce the multi-ow problem into a family of single-ow problems, for which we can analyze both theoretically and numerically the existence of optimal control policies of special structure. In particular, we show that for a variety of parameters, TCP ows can be optimally controlled in routers by so-called index policies. We have implemented index policies in Network Simulator-3 (NS-3) and compared its performance with DropTail and RED buffers. The simulation results show that the index policy has several desirable properties with respect to fairness and efficiency.

U2 - 10.1145/2425248

DO - 10.1145/2425248

M3 - Journal article

VL - 40

SP - 62

EP - 64

JO - ACM SIGMETRICS Performance Evaluation Review

JF - ACM SIGMETRICS Performance Evaluation Review

SN - 0163-5999

IS - 3

ER -