Optimal congestion control of TCP flows for internet routers

In this work we address the problem of fast and fair transmission of flows 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...

Descripción completa

Detalles Bibliográficos
Autores: Avrachenkov, K., Ayesta, U., Doncel, J., Jacko, P.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2012
País:España
Institución:Basque Center for Applied Mathematics (BCAM)
Repositorio:BIRD. BCAM's Institutional Repository Data
OAI Identifier:oai:bird.bcamath.org:20.500.11824/395
Acceso en línea:http://hdl.handle.net/20.500.11824/395
Access Level:acceso abierto
id ES_0591c64999717aef42d96b08da4e2e86
oai_identifier_str oai:bird.bcamath.org:20.500.11824/395
network_acronym_str ES
network_name_str España
repository_id_str
spelling Optimal congestion control of TCP flows for internet routersAvrachenkov, K.Ayesta, U.Doncel, J.Jacko, P.In this work we address the problem of fast and fair transmission of flows 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-flow problem into a family of single-flow 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 flows 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. Copyright is held by author/owner(s).201720172012info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/20.500.11824/395reponame:BIRD. BCAM's Institutional Repository Datainstname:Basque Center for Applied Mathematics (BCAM)Ingléshttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84883476059&doi=10.1145%2f2425248.2425263&partnerID=40&md5=fab290fa23f4755e20e973cea10f0599Reconocimiento-NoComercial-CompartirIgual 3.0 Españahttp://creativecommons.org/licenses/by-nc-sa/3.0/es/info:eu-repo/semantics/openAccessoai:bird.bcamath.org:20.500.11824/3952026-06-19T12:47:47Z
dc.title.none.fl_str_mv Optimal congestion control of TCP flows for internet routers
title Optimal congestion control of TCP flows for internet routers
spellingShingle Optimal congestion control of TCP flows for internet routers
Avrachenkov, K.
title_short Optimal congestion control of TCP flows for internet routers
title_full Optimal congestion control of TCP flows for internet routers
title_fullStr Optimal congestion control of TCP flows for internet routers
title_full_unstemmed Optimal congestion control of TCP flows for internet routers
title_sort Optimal congestion control of TCP flows for internet routers
dc.creator.none.fl_str_mv Avrachenkov, K.
Ayesta, U.
Doncel, J.
Jacko, P.
author Avrachenkov, K.
author_facet Avrachenkov, K.
Ayesta, U.
Doncel, J.
Jacko, P.
author_role author
author2 Ayesta, U.
Doncel, J.
Jacko, P.
author2_role author
author
author
description In this work we address the problem of fast and fair transmission of flows 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-flow problem into a family of single-flow 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 flows 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. Copyright is held by author/owner(s).
publishDate 2012
dc.date.none.fl_str_mv 2012
2017
2017
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.11824/395
url http://hdl.handle.net/20.500.11824/395
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv https://www.scopus.com/inward/record.uri?eid=2-s2.0-84883476059&doi=10.1145%2f2425248.2425263&partnerID=40&md5=fab290fa23f4755e20e973cea10f0599
dc.rights.none.fl_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:BIRD. BCAM's Institutional Repository Data
instname:Basque Center for Applied Mathematics (BCAM)
instname_str Basque Center for Applied Mathematics (BCAM)
reponame_str BIRD. BCAM's Institutional Repository Data
collection BIRD. BCAM's Institutional Repository Data
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869402863471427584
score 15,300719

Similares en LA Referencia