数据段 数据流 tcp_数据中心TCP解释

数据段 数据流 tcp

Microsoft Research in 2010 and called, surprisingly, DataCenter TCP (DCTCP). Microsoft Research在2010年开发的,令人惊讶的是,它被称为数据中心TCP(DCTCP)。

DCTCP is a set of modification to TCP, targeting to fulfill two properties:

DCTCP是对TCP的一组修改,旨在满足以下两个属性:

1. Improve latency for latency-sensitive small messages

1.改善对延迟敏感的小消息的延迟

2. Not to decrease the throughput for throughput-sensitive big flows

2.不降低吞吐量敏感型大流量的吞吐量

The latency inside the network comes out of queueing inside routers. Therefore, DCTCP tries to keep the queue small. Queue remains small when its size is lower than K messages.

网络内部的延迟来自路由器内部的排队。 因此,DCTCP尝试使队列变小。 当队列的大小小于K条消息时,它仍然很小。

The proposed algorithm adaptively shrinks the TCP congestion window such that queue remains small.

所提出的算法自适应地缩小TCP拥塞窗口,以使队列保持较小。

The improvements over TCP requires modification of all three components: router, receiver, sender:

对TCP的改进要求修改所有三个组件:路由器,接收器,发送器:

1. Marking packets with Congestion Experienced (CE) flag while queue becomes longer than K by a router.

1.当路由器使队列的长度大于K时,使用“拥塞经历”(CE)标志标记数据包。

2. Transforming a stream of CE flags into a stream of ACK TCP packets by a receiver. More specifically, the receiver immediately sends ACK if CE flag in current packet is different from the previous one. While the CE flag is unchanged, it sends normal Delayed ACKs. ACK packet always contains the last value of the CE flag.

2.接收器将CE标志流转换为ACK TCP数据包流。 更具体地说,如果当前数据包中的CE标志与前一个不同,则接收方立即发送ACK。 当CE标志不变时,它会发送正常的延迟ACK。 ACK数据包始终包含CE标志的最后一个值。

3. Adapting congestion window size based on the aggregated ECN-Echo packet stream by the sender. First, sender calculates the Congestion Ratio (CR) — the exponential moving average among CE flags. DCTCP scales down the window size proportionally to CR. If CR is equal to 1 (every packet had CE flag), window size would be halved, just like TCP.

3.基于发送者的聚集的ECN-Echo分组流来调整拥塞窗口大小。 首先,发送方计算拥塞率(CR)-CE标志之间的指数移动平均值。 DCTCP与CR成比例地缩小窗口大小。 如果CR等于1(每个数据包都有CE标志),则窗口大小将减半,就像TCP一样。

The evaluation shows that query latency is significantly better for short transfers. Performance for throughput-sensitive requests is not worse.

该评估表明,查询延迟对于短传输而言明显更好。 对吞吐量敏感的请求的性能并不差。

Although, since 2010 there were several papers with review and improvements of DCTCP.

但是,自2010年以来,有几篇论文对DCTCP进行了回顾和改进。

«Ease the Queue Oscillation: Analysis and Enhancement of DCTCP» from 2013 makes an experiment and finds out that DCTCP is subject to severe oscillation of actual queue size. This happens because between first packet with CE flag and the reaction of sender there is at least RTT delay. The paper proposes to split a single threshold K into two threshold K1 < K < K2 such that setting CE flags starts when queue size equal to K1, before actual congestion is experienced, and stops at K2, before queue size will be too much reduced.

2013年的《缓解队列振荡:DCTCP的分析和增强》进行了一项实验,发现DCTCP受到实际队列大小的严重振荡的影响。 发生这种情况是因为在带有CE标志的第一个数据包与发送方的React之间至少存在RTT延迟。 本文建议将单个阈值K分成两个阈值K1 <K <K2,以便在队列大小等于K1时(在经历实际拥塞之前)开始设置CE标志,而在队列大小减小太多之前在K2处停止设置CE标志。

Another paper is «An early congestion feedback and rate adjustment schemes for many-to-one communication in cloud-based data» published in 2015, which proposes NewDCTCP — which includes two improvements:

另一篇论文是《用于基于云的数据中多对一通信的早期拥塞反馈和速率调整方案》,发表于2015年,提出了NewDCTCP,其中包括两项改进:

1. CE flags are set even for packets arrived before the congestion

1.即使在拥塞之前到达的数据包也设置CE标志

2. Different scheme of window size adjustment

2.不同的窗口大小调整方案

One of the latest papers is «Multiple Congestion Points and Congestion Reaction Mechanisms for Improving DCTCP Performance in Data Center Networks» published in June 2018, which shows that the topic remains up-to-date and the problem is yet unsolved. Anyway, the paper combines the double threshold approach and introduce a new idea — congestion window adjustment. It takes into account the number of sent packages and received ACKs during the window size change.

最新论文之一是2018年6月发布的《用于提高数据中心网络中DCTCP性能的多个拥塞点和拥塞React机制》,表​​明该主题仍然是最新的,但问题尚未解决。 无论如何,本文结合了双阈值方法并引入了一个新的想法-拥塞窗口调整。 它考虑了窗口大小更改期间已发送的程序包和已接收的ACK的数量。

翻译自: https://habr.com/en/post/474282/

数据段 数据流 tcp

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值