On traffic fairness in data center fabrics

Dallal Belabed, Stefano Secci, G. Pujolle, D. Medhi
{"title":"On traffic fairness in data center fabrics","authors":"Dallal Belabed, Stefano Secci, G. Pujolle, D. Medhi","doi":"10.1109/CloudNet.2014.6968966","DOIUrl":null,"url":null,"abstract":"A present challenge in data center networks (DCN) is to better understand the impact of novel flattened and modular DCN architectures on congestion control protocols, and viceversa. One of the major concerns in congestion control being the fairness in the offered throughput, the impact of the additional path diversity and forwarding features, brought by the novel DCN architectures and protocols, on the throughput of individual endpoints (servers) and aggregation points (edge switches) is unclear. This paper attempts to answer these open questions. Specifically, how best is the allocation of the competing elastic demand flows and how is this allocation impacted with the increase in capacity? We provide an optimization formulation of the problem based on the proportional fairness principle of TCP. We conducted a series of test scenarios on the fat-tree data center topology by considering load balancing and link capacities for different network cases in order to present our analysis on the results. We observed that the traffic allocation fairness is primarily impacted by the weights associated with the TCP implementation in use.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet.2014.6968966","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A present challenge in data center networks (DCN) is to better understand the impact of novel flattened and modular DCN architectures on congestion control protocols, and viceversa. One of the major concerns in congestion control being the fairness in the offered throughput, the impact of the additional path diversity and forwarding features, brought by the novel DCN architectures and protocols, on the throughput of individual endpoints (servers) and aggregation points (edge switches) is unclear. This paper attempts to answer these open questions. Specifically, how best is the allocation of the competing elastic demand flows and how is this allocation impacted with the increase in capacity? We provide an optimization formulation of the problem based on the proportional fairness principle of TCP. We conducted a series of test scenarios on the fat-tree data center topology by considering load balancing and link capacities for different network cases in order to present our analysis on the results. We observed that the traffic allocation fairness is primarily impacted by the weights associated with the TCP implementation in use.
数据中心结构中的流量公平性研究
数据中心网络(DCN)目前面临的一个挑战是更好地理解新型扁平和模块化DCN架构对拥塞控制协议的影响,反之亦然。拥塞控制的主要关注点之一是所提供吞吐量的公平性,新的DCN架构和协议带来的额外路径多样性和转发特性对单个端点(服务器)和聚合点(边缘交换机)的吞吐量的影响尚不清楚。本文试图回答这些悬而未决的问题。具体来说,如何最好地分配竞争的弹性需求流,这种分配如何受到容量增加的影响?基于TCP的比例公平原则,给出了该问题的优化表述。我们在胖树数据中心拓扑上执行了一系列测试场景,考虑了不同网络情况下的负载平衡和链路容量,以便展示我们对结果的分析。我们观察到,流量分配公平性主要受到与所使用的TCP实现相关的权重的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书