pFabric: minimal near-optimal datacenter transport
pFabric: minimal near-optimal datacenter transport
复制标题
DOI：
10.1145/2486001.2486031
复制
发表时间：
2013-08
期刊：
影响因子：
--
通讯作者：
Mohammad Alizadeh;Shuang Yang;M. Sharif;S. Katti;N. McKeown;B. Prabhakar;S. Shenker
中科院分区：
文献类型：
--
作者：
Mohammad Alizadeh;Shuang Yang;M. Sharif;S. Katti;N. McKeown;B. Prabhakar;S. Shenker
在本文中，我们提出了pFabric，一个极简的数据中心传输设计，提供接近理论上最佳的流完成时间，即使在第99百分位数的短流，同时仍然最大限度地减少平均流完成时间长流。此外，pFabric通过一个非常简单的设计提供了这种性能，该设计基于一个关键的概念性见解：数据中心传输应该将流调度与速率控制解耦。对于流调度，数据包携带由每个流独立设置的单个优先级编号;交换机具有非常小的缓冲区，并实现非常简单的基于优先级的调度/丢弃机制。速率控制也相应地更简单;流以线路速率开始，并且仅在高且持续的分组丢失的情况下进行节流。我们提供了理论上的直觉，并通过大量的模拟表明，这两个简单的机制的组合足以提供接近最佳的性能。
In this paper we present pFabric, a minimalistic datacenter transport design that provides near theoretically optimal flow completion times even at the 99th percentile for short flows, while still minimizing average flow completion time for long flows. Moreover, pFabric delivers this performance with a very simple design that is based on a key conceptual insight: datacenter transport should decouple flow scheduling from rate control. For flow scheduling, packets carry a single priority number set independently by each flow; switches have very small buffers and implement a very simple priority-based scheduling/dropping mechanism. Rate control is also correspondingly simpler; flows start at line rate and throttle back only under high and persistent packet loss. We provide theoretical intuition and show via extensive simulations that the combination of these two simple mechanisms is sufficient to provide near-optimal performance.