On the efficacy of fine-grained traffic splitting protocolsin data center networks

A. Dixit, P. Prakash, R. Kompella
{"title":"On the efficacy of fine-grained traffic splitting protocolsin data center networks","authors":"A. Dixit, P. Prakash, R. Kompella","doi":"10.1145/2018436.2018504","DOIUrl":null,"url":null,"abstract":"Multi-rooted tree topologies are commonly used to construct high-bandwidth data center network fabrics. In these networks, switches typically rely on equal-cost multipath (ECMP) routing techniques to split traffic across multiple paths, such that packets within a flow traverse the same end-to-end path. Unfortunately, since ECMP splits traffic based on flow-granularity, it can cause load imbalance across paths resulting in poor utilization of network resources. More fine-grained traffic splitting techniques are typically not preferred because they can cause packet reordering that can, according to conventional wisdom, lead to severe TCP throughput degradation. In this work, we revisit this fact in the context of regular data center topologies such as fat-tree architectures. We argue that packet-level traffic splitting, where packets of a flow are sprayed through all available paths, would lead to a better load-balanced network, which in turn leads to significantly more balanced queues and much higher throughput compared to ECMP.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"329 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM SIGCOMM 2011 conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2018436.2018504","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

Multi-rooted tree topologies are commonly used to construct high-bandwidth data center network fabrics. In these networks, switches typically rely on equal-cost multipath (ECMP) routing techniques to split traffic across multiple paths, such that packets within a flow traverse the same end-to-end path. Unfortunately, since ECMP splits traffic based on flow-granularity, it can cause load imbalance across paths resulting in poor utilization of network resources. More fine-grained traffic splitting techniques are typically not preferred because they can cause packet reordering that can, according to conventional wisdom, lead to severe TCP throughput degradation. In this work, we revisit this fact in the context of regular data center topologies such as fat-tree architectures. We argue that packet-level traffic splitting, where packets of a flow are sprayed through all available paths, would lead to a better load-balanced network, which in turn leads to significantly more balanced queues and much higher throughput compared to ECMP.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
细粒度的功效交通分裂protocolsin数据中心网络
多根树是构建高带宽数据中心网络结构的常用拓扑结构。在这些网络中,交换机通常依赖于等成本多路径(ECMP)路由技术将流量分散到多个路径上,这样流中的数据包就会遍历相同的端到端路径。不幸的是,由于ECMP是基于流粒度对流量进行拆分的,因此它可能导致跨路径的负载不平衡,从而导致网络资源利用率低下。更细粒度的流量分割技术通常不受欢迎,因为它们可能导致数据包重新排序,根据传统观点,这会导致严重的TCP吞吐量下降。在这项工作中,我们将在常规数据中心拓扑(如胖树架构)的背景下重新审视这一事实。我们认为,数据包级别的流量分割,即流的数据包通过所有可用路径喷射,将导致更好的负载平衡网络,这反过来又导致显着更平衡的队列和比ECMP高得多的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The evolution of layered protocol stacks leads to an hourglass-shaped architecture Improving datacenter performance and robustness with multipath TCP Understanding the impact of video quality on user engagement Insomnia in the access: or how to curb access network related energy consumption Optimizing a virtualized data center
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1