arrow
返回

Implicit admission control

delete2000-12-01
delete40
PRE
AI
R
Richard Mortier *
I
Ian Pratt
C
Corey Clark
S
Scott A. Crosby
DOI:10.1109/49.898743delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Internet protocols currently use packet-level mechanisms to detect and react to congestion, Although these controls are essential to unsure fair sharing of the available resource between multiple flows, In some cases they are insufficient to ensure overall network stability We believe that it is also necessary to take account of higher level concepts, such as connections, flows, and sessions when controlling network congestion. This becomes of increasing importance as more real-time traffic is carried on the Internet, since this traffic is less elastic in nature than traditional web traffic. We 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! present a simple connection admission control (CAC) scheme which can significantly 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 infrastructure. Simulation results are used to show that it can drastically improve 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 operating system. We show that by giving routers at bottlenecks the ability to intelligently deny admission to TCP connections, the goodput of existing connections can be significantly increased, Furthermore, the fairness of the resource allocation achieved by TCP is improved.
Keyword:
admission control
Internet
quality of service
transmission control protocol (TCP)
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Journal on Selected Areas in Communications 封面图
IEEE Journal on Selected Areas in Communications
IF:
17.2
论文数:
6.4K
被引数:
3.1W

机构

暂无机构信息