募捐 9月15日2024 – 10月1日2024 关于筹款

Accumulation-Based Congestion Control

Accumulation-Based Congestion Control

Xia Y., Harrison D., Kalyanaraman S., Ramachandran K., Venkatesan A.
你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 1, FEBRUARY 2005.
This paper generalizes the TCP Vegas congestion avoidance mechanism and uses accumulation, buffered packets of a flow inside network routers, as a congestion measure based on which a family of congestion control schemes can be derived. This model is called Accumulation-based Congestion Control (ACC), which fits into the nonlinear optimization framework proposed by Kelly. The ACC model serves as a reference for packet-switching network implementations. TCP Vegas is one possible scheme under this model. It is well known that Vegas suffers from round trip propagation delay estimation error and reverse path congestion. A new Monaco scheme is designed that solves these problems by employing an out-of-band, receiver-based accumulation estimator, with the support of two FIFO priority queues from the (congested) routers. Comparisons between these two schemes demonstrate that Monaco does not suffer from the problems mentioned above and achieves better performance than Vegas. NS-2 simulations and Linux implementation experiments are used to show that the static and dynamic performance of Monaco matches the theoretic results. One key issue regarding the ACC model in general, i.e. , the scalability of bottleneck buffer requirement, and a solution using a virtual queueing algorithm are discussed and evaluated.
Accumulation, congestion control, TCP.
语言:
english
文件:
PDF, 828 KB
IPFS:
CID , CID Blake2b
english0
线上阅读
正在转换
转换为 失败

关键词