Modified Controlling Queue Delay for TCP fairness improvement

Masato Hanai, Saneyasu Yamaguchi, A. Kobayashi
{"title":"Modified Controlling Queue Delay for TCP fairness improvement","authors":"Masato Hanai, Saneyasu Yamaguchi, A. Kobayashi","doi":"10.1109/APNOMS.2016.7737224","DOIUrl":null,"url":null,"abstract":"For overcoming performance decline caused by current long fat networks, many high performance TCPs have been proposed, such as Compound TCP and CUBIC TCP. These proposals have raised a new issue, which is fairness among these modern TCPs. For this issue, several fairness evaluations and some proposals for improving fairness were published. In our past work, we focused on Controlling Queue Delay (CoDel) and proposed a method for improving performance fairness of modern TCPs by modifying CoDel. However, this existing method assumed that the most bandwidth-consuming connection was given for network elements. In this paper, we discuss a method for improving TCP fairness without such an assumption. First, we present fairness evaluation among modern TCPs with and without CoDel, and then demonstrate that fairness among these TCPs is very poor. Second, we propose a method for improving performance fairness. The method monitors network packets and guesses the most bandwidth-consuming connection from the monitored packets. Then, it drops packets in the most bandwidth-consuming connections more aggressively in the network element. Third, we evaluate our proposed method and show that our method can improve performance fairness.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2016.7737224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

For overcoming performance decline caused by current long fat networks, many high performance TCPs have been proposed, such as Compound TCP and CUBIC TCP. These proposals have raised a new issue, which is fairness among these modern TCPs. For this issue, several fairness evaluations and some proposals for improving fairness were published. In our past work, we focused on Controlling Queue Delay (CoDel) and proposed a method for improving performance fairness of modern TCPs by modifying CoDel. However, this existing method assumed that the most bandwidth-consuming connection was given for network elements. In this paper, we discuss a method for improving TCP fairness without such an assumption. First, we present fairness evaluation among modern TCPs with and without CoDel, and then demonstrate that fairness among these TCPs is very poor. Second, we propose a method for improving performance fairness. The method monitors network packets and guesses the most bandwidth-consuming connection from the monitored packets. Then, it drops packets in the most bandwidth-consuming connections more aggressively in the network element. Third, we evaluate our proposed method and show that our method can improve performance fairness.
修改了控制队列延迟,提高TCP公平性
为了克服当前长胖网络带来的性能下降,人们提出了许多高性能的TCP协议,如Compound TCP和CUBIC TCP。这些提议提出了一个新的问题,即现代tcp之间的公平问题。针对这一问题,发表了若干公平性评价和提高公平性的建议。在过去的工作中,我们主要关注控制队列延迟(CoDel),并提出了一种通过修改队列延迟来提高现代tcp性能公平性的方法。然而,现有的方法假设网络元素的带宽消耗最大。在本文中,我们讨论了一种不用这种假设来提高TCP公平性的方法。首先,我们对有CoDel和没有CoDel的现代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学术官方微信