A New Approach of Admission Control for TCP Flows

With the fast evolution of IP networks, new approaches have been proposed to maintain the quality of service (QoS) of existing and new applications. Recent papers have shown the interest of introducing flow level admission control mechanisms. The key idea is to guarantee for each accepted flow a minimum of resources by limiting the number of flows accepted in the network. Most of the current works suppose that the bandwidth sharing between several elastic flows is of "processor sharing" type. This assumption is valid for long TCP flows. Nevertheless, it is more difficult to justify it for short flows. In this paper, we propose a new approach of admission control for TCP flows that deals with short and long flows, as well as with the specific QoS constraints of each type of flow. Based on analyses and simulations, we show the advantage of the proposed approach in terms of performance. Moreover, we evaluate the impact of allocating resources to the long and short flows aggregates through a WFQ scheduling