Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates

DSpace/Manakin Repository

Show simple item record Fàbrega i Soler, Lluís Jové Lagunas, Teodor Vilà Talleda, Pere Marzo i Lázaro, Josep Lluís Carrillo, Liliana 2006
dc.identifier.citation Fàbrega i Soler, Lluís, Jové Lagunas, Teodor, Vilà Talleda, Pere, Marzo i Lázaro, Josep Lluís, i Carrillo, Liliana (2006). Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates. IEEE International Conference on Communications : 2006 : ICC '06, 2, 760-765. Recuperat 06 maig 2010, a
dc.identifier.isbn 1-4244-0355-3
dc.identifier.issn 8164-9547
dc.description.abstract TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher IEEE
dc.relation.isformatof Reproducció digital del document publicat a:
dc.relation.ispartof © IEEE International Conference on Communications : 2006 : ICC '06, 2006, vol. 2, p. 760-765
dc.relation.ispartofseries Articles publicats (D-ATC)
dc.rights Tots els drets reservats
dc.subject TCP/IP (Protocol de xarxes d'ordinadors)
dc.subject TCP/IP (Computer network protocol)
dc.title Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates
dc.type info:eu-repo/semantics/article

Files in this item


Show simple item record

Search DUGiDocs


My Account


views icon 708 downloads icon 426


This file is restricted

The file you are attempting to access is a restricted file and requires credentials to view. Please login below to access the file.

  1. We will contact you via the email address you have provided us.

Request a copy

When filling up the form you are requesting to the author or main author a copy of his/her article, which is stored in the institutional repository (DUGiDocs). Author decides himself/herlself whether it is appropiate to deliver a copy of the document to the requester or nott. In any case, the Library of the UdG doesn't participate in the process, as it isn't allowed to deliver any restricted articles.