瓶颈
计算机科学
显式拥塞通知
通信源
窗口(计算)
实时计算
网络拥塞
计算机网络
排队论
还原(数学)
控制(管理)
远程直接内存访问
数据中心
流量控制(数据)
慢启动
吞吐量
服务器
分布式计算
作者
Keita Aoki,Miki Yamamoto
标识
DOI:10.1109/icnp65844.2025.11192331
摘要
In RDMA data center networks with multiple bottlenecks, a sender may overestimate level of congestion because ECNs are marked independently at multiple bottleneck switches along the path. This congestion overestimation problem is difficult to address because the sender cannot identify where congestion signals are originated. In this paper, we propose a selective ECN marking method in which each switch filters ECN marks based on local congestion severity. Simulation results show that our method improves fairness and prevents excessive rate reduction in multiple-bottleneck scenarios.
科研通智能强力驱动
Strongly Powered by AbleSci AI