Implicit admission control

Internet protocols currently use packet-level mechanisms to detect and reac t to congestion, Although these controls are essential to unsure fair shari ng of the available resource between multiple flows, In some cases they are insufficient to ensure overall network stability We believe that it is als o necessary to take account of higher level concepts, such as connections, flows, and sessions when controlling network congestion. This becomes of in creasing importance as more real-time traffic is carried on the Internet, s ince this traffic is less elastic in nature than traditional web traffic. W e argue that, in order to achieve better utility of the network as a whole, higher level congestion controls are required, By way of example, wt! pres ent a simple connection admission control (CAC) scheme which can significan tly improve overall performance. This paper discusses our motivation for the use of admission control in the Internet, focusing specifically on control for TCP flows. The technique is not TCP specific, and can be applied to any type of flow in a modern IP in frastructure. Simulation results are used to show that it can drastically i mprove the performance of TCP over bottleneck links. We go on to describe! an implementation of our algorithm for a router running the Linux 2.2.9 ope rating system. We show that by giving routers at bottlenecks the ability to intelligently deny admission to TCP connections, the goodput of existing c onnections can be significantly increased, Furthermore, the fairness of the resource allocation achieved by TCP is improved.