计算机科学
排队延迟
计算机网络
网络拥塞
主动队列管理
网络数据包
流量控制(数据)
试验台
排队论
路由器
公平排队
排队
网络流量控制
网络延迟
数据包丢失
服务质量
循环调度
公平份额计划
作者
Junseon Kim,Youngbin Im,Kyunghan Lee
出处
期刊:IEEE ACM Transactions on Networking
[Institute of Electrical and Electronics Engineers]
日期:2023-06-16
卷期号:32 (1): 3-16
标识
DOI:10.1109/tnet.2023.3268721
摘要
Unexpected large packet delays are often observed in cellular networks due to huge network queuing caused by excessive traffic coming into the network. To deal with the large queue problem, many congestion control algorithms try to find out how much traffic the network can accommodate, either by measuring network performance or by directly providing explicit information. However, due to the nature of the control in which queue growth should be observed or the necessity to modify the overall network architecture, existing algorithms are experiencing difficulties in keeping queues within a strict bound. In this paper, we propose a novel congestion control algorithm based on simple feedback, ECLAT which can provide bounded queuing delay using only one-bit signaling already available in traditional network architecture. To do so, a base station or a router running ECLAT 1) calculates how many packets each flow should transmit and 2) analyzes when congestion feedback needs to be forwarded to adjust the flow's packet transmission to the desired rate. Our extensive experiments in our testbed demonstrate that ECLAT achieves strict queuing delay bounds, even in the dynamic cellular network environment.
科研通智能强力驱动
Strongly Powered by AbleSci AI