MPICC: Multi-Path INT-Based Congestion Control in Datacenter Networks

计算机科学 网络拥塞 计算机网络 流量控制(数据) 隐藏物 网络数据包 数据包丢失 显式拥塞通知 吞吐量 分布式计算 实时计算 TCP调整 电信 无线
作者
Guoyuan Yuan,Dezun Dong,Xingyun Qi,Baokang Zhao
出处
期刊:Lecture Notes in Computer Science [Springer Science+Business Media]
卷期号:: 256-268 被引量:1
标识
DOI:10.1007/978-3-030-93571-9_20
摘要

Network congestion causes severe transmission performance loss. Congestion control is the key to achieve low latency, high bandwidth and high stability. Due to the high regularity of topologies, datacenter networks contain abundant resources of equal-cost paths inherently and have huge potential for high-bandwidth transmission. Taking in-network telemetry (INT) information as the congestion signal, congestion control algorithms can monitor the network based on precise link load data. Hence the INT-based algorithm is the focus of recent high-precision congestion control research. However, existing INT-based congestion control algorithms handle the single-path transmission between the sender and the receiver, which cannot make full use of the abundant equal-cost paths resources in the network. In this paper, we make the first attempt to propose a multi-path INT-based congestion control algorithm, called MPICC. Compared with the most advanced INT-based congestion control algorithm HPCC, our method realizes multi-path coordinated transmission of data packets in datacenter networks. We conduct extensive experiments under various workloads to evaluate the performance of MPICC. The experimental results show that under the condition of ensuring high throughput of end hosts, MPICC is able to use multi-path to transmit data packets, which greatly reduces the flow completion time (FCT) of the flow in the network. Specifically, under three common datacenter workloads, Cache Follower, Web Search and Web Server, MPICC reduces the average flow completion time of the network by 20.1%, 14.4%, and 39.5%, respectively, and shortens the 97th-percentile flow completion time by 39.9%, 18.9% and 57.9%, respectively.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
风中过客发布了新的文献求助10
刚刚
3秒前
aajhajkahna应助亮仔采纳,获得10
3秒前
luocan完成签到,获得积分10
4秒前
4秒前
柳友灵完成签到,获得积分10
6秒前
恭喜发财完成签到,获得积分10
7秒前
英姑应助典雅煎蛋采纳,获得10
7秒前
Cassian完成签到,获得积分10
8秒前
8秒前
9秒前
9秒前
牛马学生完成签到,获得积分10
10秒前
xixi完成签到,获得积分10
10秒前
思源应助Mr强采纳,获得10
10秒前
万能图书馆应助123456采纳,获得10
11秒前
CodeCraft应助bowen采纳,获得10
11秒前
哇塞完成签到,获得积分10
11秒前
sdahjjyk发布了新的文献求助10
12秒前
科研通AI6.2应助TiTi采纳,获得10
12秒前
丘比特应助zxx采纳,获得10
12秒前
呼呼发布了新的文献求助10
13秒前
钰拉A梦应助MQ采纳,获得10
14秒前
爆米花应助跳跃涵易采纳,获得10
14秒前
小八路完成签到,获得积分10
15秒前
15秒前
15秒前
nanmu发布了新的文献求助10
16秒前
17秒前
科研通AI2S应助活力忆雪采纳,获得10
17秒前
17秒前
18秒前
香蕉觅云应助李杰春采纳,获得10
18秒前
科研通AI6.4应助科研小巴采纳,获得10
19秒前
Jasper应助oliverwhite采纳,获得10
20秒前
聪明短靴发布了新的文献求助10
20秒前
小蘑菇应助zhaimengting采纳,获得10
20秒前
21秒前
科研通AI6.4应助恭喜发财采纳,获得10
22秒前
张力航发布了新的文献求助10
22秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Principles of town planning: translating concepts to applications 1000
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
核安全综合知识2024版 500
Photothermal Science and Techniques 500
Digital Displacement Hydrostatic Transmission for Rotorcraft and Distributed Propulsion 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7705237
求助须知:如何正确求助?哪些是违规求助? 9262964
关于积分的说明 20040575
捐赠科研通 7280815
什么是DOI,文献DOI怎么找? 3295211
关于科研通互助平台的介绍 2450251
邀请新用户注册赠送积分活动 2302091