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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
2秒前
可爱的函函应助torch132采纳,获得10
2秒前
orixero应助DrKe采纳,获得20
3秒前
nicole发布了新的文献求助10
4秒前
Kepler发布了新的文献求助10
4秒前
lvvyy完成签到,获得积分10
5秒前
木子林希儿完成签到,获得积分10
5秒前
郭囯完成签到,获得积分10
5秒前
烟花应助小黄人采纳,获得10
6秒前
xf完成签到,获得积分10
6秒前
饱满如风完成签到,获得积分20
6秒前
冰苏打完成签到,获得积分10
6秒前
6秒前
6秒前
王贺发布了新的文献求助10
7秒前
7秒前
lvvyy发布了新的文献求助10
8秒前
Iris完成签到 ,获得积分10
9秒前
JM完成签到,获得积分10
9秒前
winnie发布了新的文献求助10
9秒前
Lucas应助科研通管家采纳,获得10
10秒前
郭文钦完成签到 ,获得积分10
10秒前
10秒前
10秒前
情怀应助科研通管家采纳,获得10
10秒前
乐乐应助刘俊豪采纳,获得10
10秒前
小蘑菇应助科研通管家采纳,获得10
10秒前
诚心香菇应助科研通管家采纳,获得20
10秒前
柒7应助科研通管家采纳,获得10
10秒前
10秒前
今后应助科研通管家采纳,获得10
10秒前
Owen应助科研通管家采纳,获得10
11秒前
饱满如风发布了新的文献求助10
11秒前
丘比特应助科研通管家采纳,获得10
11秒前
英俊的铭应助科研通管家采纳,获得10
11秒前
Akim应助科研通管家采纳,获得10
11秒前
11秒前
隐形曼青应助科研通管家采纳,获得10
11秒前
传奇3应助科研通管家采纳,获得10
11秒前
11秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Development of a Bridge Weigh-In-Motion System: A technology to convert the bridge response to the passage of traffic into data on vehicle configurations, speeds, times of travel and weights 1000
Molecular Mechanisms of Photosynthesis, 4th Edition 1000
Organic Reactions, Volume 116 1000
Current concepts in cutaneous toxicity : proceedings of the Fourth Conference on Cutaneous Toxicity, Washington, D.C., May 9-11, 1979 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7264939
求助须知:如何正确求助?哪些是违规求助? 8886072
关于积分的说明 18779738
捐赠科研通 6942736
什么是DOI,文献DOI怎么找? 3202782
关于科研通互助平台的介绍 2375987
邀请新用户注册赠送积分活动 2178699