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

Authors: Lluís Fàbrega, Teodor Jové, Pere Vilà, José Marzo, Liliana Carrillo

Complete Citation

• Lluís Fàbrega, Teodor Jové, Pere Vilà, José Marzo, Liliana Carrillo. Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates. ICC 2006: 760 - 765

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. The results prove that the scheme guarantees the requested throughput to accepted flows and achieves a high utilization of resources.

Annotations

This paper proposed an intra-domain admission control scheme which can provide different minimum throughput to different users:

• Model of proposed scheme:
  
• Intra-domain
• Probing packets from ingress to egress are used to compute edge-to-edge available bandwidth
• Egress gathers available bandwidth information periodicaly and sends it to ingress
• Ingress does the admission control

• Network topology in simulation: TCP file sizes are obtained from a pareto distribution.
  

• Simulation result: Total traffic load for flows with satisfied QoS.
  

-- YingxinJiang - 15 Aug 2007