Schemes for Fast Transmission of Flows in Data Center Networks

Schemes for Fast Transmission of Flows in Data Center Networks
复制标题

DOI:
10.1109/comst.2015.2427199
复制
发表时间:
2015-04
影响因子:
35.6
通讯作者:
R. Rojas-Cessa;Yagiz Kaymak;Z. Dong
R. Rojas-Cessa;Yagiz Kaymak;Z. Dong
中科院分区:
计算机科学1区
文献类型:
--
作者:
R. Rojas-Cessa;Yagiz Kaymak;Z. Dong

文献摘要

被引文献

相似文献

在本文中,我们调查不同的现有计划的数据中心网络(DCN)的流量传输。DCN中的流传输必须科普大量数据中心应用程序生成的流量的带宽需求,并实现数据中心基础设施的高利用率,以使数据中心在财务上可行。DCN中的业务大致包括短流和长流,短流由若干应用采用的分区/聚合模型生成,并且具有几个字节的大小,长流是用于数据中心的操作和维护的数据,并且具有兆字节量级的大小。短流必须尽快或在截止日期内传输(或完成),长流必须以最小可接受吞吐量提供服务。短流和长流的共存可能会危及同时实现两个性能目标。这一挑战激发了对DCN中流传输管理方案的研究。我们描述了几个最近的计划,旨在减少在DCN流完成时间。我们还提出了一个总结现有的解决方案的incast交通现象。对所调查的方案进行了比较和分类,描述了它们的优缺点,并展示了方案设计的不同趋势。为了完整起见,我们描述了一些DCN架构,讨论了DCN的流量模式,并讨论了为什么一些现有版本的传输协议可能无法在DCN中使用。最后,我们讨论了一些确定的研究挑战。
In this paper, we survey different existing schemes for the transmission of flows in Data Center Networks (DCNs). The transport of flows in DCNs must cope with the bandwidth demands of the traffic that a large number of data center applications generates and achieve high utilization of the data center infrastructure to make the data center financially viable. Traffic in DCNs roughly comprises short flows, which are generated by the Partition/Aggregate model adopted by several applications and have sizes of a few kilobytes, and long flows, which are data for the operation and maintenance of the data center and have sizes on the order of megabytes. Short flows must be transmitted (or completed) as soon as possible or within a deadline, and long flows must be serviced with a minimum acceptable throughput. The coexistence of short and long flows may jeopardize achieving both performance objectives simultaneously. This challenge has motivated growing research on schemes for managing the transmission of flows in DCNs. We describe several recent schemes aimed at reducing the flow completion time in DCNs. We also present a summary of existing solutions for the incast traffic phenomenon. We provide a comparison and classification of the surveyed schemes, describe their advantages and disadvantages, and show the different trends for scheme design. For completeness, we describe some DCN architectures, discuss the traffic patterns of DCNs, and discuss why some existing versions of transport protocols may not be usable in DCNs. At the end, we discuss some of the identified research challenges.