Priority-based and Throughput-guaranteed Transport protocol for data center networks

Zongyi Zhao, Qing Li, Mingwei Xu, Lei Wang, Meng Chen
{"title":"Priority-based and Throughput-guaranteed Transport protocol for data center networks","authors":"Zongyi Zhao, Qing Li, Mingwei Xu, Lei Wang, Meng Chen","doi":"10.1109/ISCC.2016.7543906","DOIUrl":null,"url":null,"abstract":"The previous surveys show that more than 90% of the flows in typical data center networks are smaller than 100KB in size, while most bytes transmitted are from a few large flows. The small flows are usually sensitive to their completion times while the large flows require a high throughput. The previous works usually either achieve low completion times for small flows or high throughput for large flows, but not both. In this paper, we propose PTT (Priority-based and Throughput-guaranteed Transport) to minimize the average completion time of small flows while guaranteeing the high throughput of large flows. We conduct comprehensive simulations to evaluate the performance of PTT. The simulation results show that PTT reduces the average completion time of small flows by up to 27.52% over DCTCP and 23.82% over L2DCT while the throughput of large flows is comparable to that in DCTCP, which is 170.46% better than that in L2DCT.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Symposium on Computers and Communication (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2016.7543906","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The previous surveys show that more than 90% of the flows in typical data center networks are smaller than 100KB in size, while most bytes transmitted are from a few large flows. The small flows are usually sensitive to their completion times while the large flows require a high throughput. The previous works usually either achieve low completion times for small flows or high throughput for large flows, but not both. In this paper, we propose PTT (Priority-based and Throughput-guaranteed Transport) to minimize the average completion time of small flows while guaranteeing the high throughput of large flows. We conduct comprehensive simulations to evaluate the performance of PTT. The simulation results show that PTT reduces the average completion time of small flows by up to 27.52% over DCTCP and 23.82% over L2DCT while the throughput of large flows is comparable to that in DCTCP, which is 170.46% better than that in L2DCT.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于优先级和吞吐量保证的数据中心网络传输协议
以往的调查表明,在典型的数据中心网络中,90%以上的流的大小小于100KB,而大多数传输的字节都来自几个大的流。小流通常对它们的完成时间很敏感,而大流则需要高吞吐量。以前的工作通常要么实现小流量的低完成时间,要么实现大流量的高吞吐量,但不是两者兼而有之。在本文中,我们提出了PTT(基于优先级和吞吐量保证的传输)来最小化小流的平均完成时间,同时保证大流的高吞吐量。我们进行了全面的仿真来评估PTT的性能。仿真结果表明,PTT使小流量的平均完成时间比DCTCP减少27.52%,比L2DCT减少23.82%,而大流量的吞吐量与DCTCP相当,比L2DCT提高了170.46%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Joint power control and sub-channel allocation for co-channel OFDMA femtocells Measuring the users and conversations of a vibrant online emotional support system An efficient KP-ABE scheme for content protection in Information-Centric Networking Energy-efficient MAC schemes for Delay-Tolerant Sensor Networks FRT-Skip Graph: A Skip Graph-style structured overlay based on Flexible Routing Tables
×
引用
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