基于历史流信息的改进单边加速FAST TCP公平性

Q4 Engineering
C. Xiaolong, Peng Zhiping
{"title":"基于历史流信息的改进单边加速FAST TCP公平性","authors":"C. Xiaolong, Peng Zhiping","doi":"10.1504/IJWMC.2013.055771","DOIUrl":null,"url":null,"abstract":"It is open problem for the FAST TCP to estimate the true propagation delay. Aiming at the open problem, according to application characteristic of unilateral accelerated FAST TCP system, a novel two layers algorithm of the transport layer is proposed. In down layer, the history information of the active FAST TCP flows, such as the start-up time and the running time of FAST TCP flows, are gathered. When a new FAST TCP flow arrives, the upper layer algorithm can provide the current queue delay of the bottleneck link based on the earliest FAST TCP flow. For the first time in the calculation propagation delay, the down layer FAST TCP algorithm estimate the accurate propagation delay based on the current round trip delay minus the queuing delay provided by the upper algorithm. Finally, the NS-2 simulation results validate the effectiveness of this improved two layers algorithm.","PeriodicalId":53709,"journal":{"name":"International Journal of Wireless and Mobile Computing","volume":"6 1","pages":"209-214"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJWMC.2013.055771","citationCount":"1","resultStr":"{\"title\":\"An improved unilateral acceleration FAST TCP fairness based on history flows information\",\"authors\":\"C. Xiaolong, Peng Zhiping\",\"doi\":\"10.1504/IJWMC.2013.055771\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is open problem for the FAST TCP to estimate the true propagation delay. Aiming at the open problem, according to application characteristic of unilateral accelerated FAST TCP system, a novel two layers algorithm of the transport layer is proposed. In down layer, the history information of the active FAST TCP flows, such as the start-up time and the running time of FAST TCP flows, are gathered. When a new FAST TCP flow arrives, the upper layer algorithm can provide the current queue delay of the bottleneck link based on the earliest FAST TCP flow. For the first time in the calculation propagation delay, the down layer FAST TCP algorithm estimate the accurate propagation delay based on the current round trip delay minus the queuing delay provided by the upper algorithm. Finally, the NS-2 simulation results validate the effectiveness of this improved two layers algorithm.\",\"PeriodicalId\":53709,\"journal\":{\"name\":\"International Journal of Wireless and Mobile Computing\",\"volume\":\"6 1\",\"pages\":\"209-214\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1504/IJWMC.2013.055771\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Wireless and Mobile Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJWMC.2013.055771\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Wireless and Mobile Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJWMC.2013.055771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

摘要

如何估计真实的传输延迟是FAST TCP的一个开放性问题。针对开放问题,根据单边加速FAST TCP系统的应用特点,提出了一种新的两层传输层算法。下一层收集活动的FAST TCP流的历史信息,如启动时间、运行时间等。当新的FAST TCP流到达时,上层算法可以根据最早的FAST TCP流提供瓶颈链路的当前队列延迟。在计算传播延迟方面,下层FAST TCP算法首次基于当前往返延迟减去上层算法提供的排队延迟来估计准确的传播延迟。最后,NS-2仿真结果验证了改进的两层算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved unilateral acceleration FAST TCP fairness based on history flows information
It is open problem for the FAST TCP to estimate the true propagation delay. Aiming at the open problem, according to application characteristic of unilateral accelerated FAST TCP system, a novel two layers algorithm of the transport layer is proposed. In down layer, the history information of the active FAST TCP flows, such as the start-up time and the running time of FAST TCP flows, are gathered. When a new FAST TCP flow arrives, the upper layer algorithm can provide the current queue delay of the bottleneck link based on the earliest FAST TCP flow. For the first time in the calculation propagation delay, the down layer FAST TCP algorithm estimate the accurate propagation delay based on the current round trip delay minus the queuing delay provided by the upper algorithm. Finally, the NS-2 simulation results validate the effectiveness of this improved two layers algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Wireless and Mobile Computing
International Journal of Wireless and Mobile Computing Computer Science-Computer Science (all)
CiteScore
0.80
自引率
0.00%
发文量
76
期刊介绍: The explosive growth of wide-area cellular systems and local area wireless networks which promise to make integrated networks a reality, and the development of "wearable" computers and the emergence of "pervasive" computing paradigm, are just the beginning of "The Wireless and Mobile Revolution". The realisation of wireless connectivity is bringing fundamental changes to telecommunications and computing and profoundly affects the way we compute, communicate, and interact. It provides fully distributed and ubiquitous mobile computing and communications, thus bringing an end to the tyranny of geography.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信