基于窗口的OBS TCP流量突发组合方案

K. Ramantas, K. Vlachos, Ó. D. Dios, C. Raffaelli
{"title":"基于窗口的OBS TCP流量突发组合方案","authors":"K. Ramantas, K. Vlachos, Ó. D. Dios, C. Raffaelli","doi":"10.1364/JON.7.000487","DOIUrl":null,"url":null,"abstract":"The impact of burstification delay on the transmission control protocol traffic statistics is presented as well as a new assembly scheme that uses flow window size as the threshold criterion. It is shown that short assembly times are ideally suitable for sources with small congestion windows, allowing for a speedup in their transmission. In addition, large assembly times do not yield any throughput gain, despite the large number of segments per burst transmitted, but result in a low throughput variation, and thus a higher notion of fairness among the individual flows. To this end we propose a new burst assembly scheme that dynamically assigns flows to different assembly queues with different assembly timers, based on their instant window size. Results show that the proposed scheme with different timers provides a higher average throughput together with a smaller variance, which is a good compromise for bandwidth dimensioning.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"487-495"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000487","citationCount":"8","resultStr":"{\"title\":\"Window-based burst assembly scheme for TCP traffic over OBS\",\"authors\":\"K. Ramantas, K. Vlachos, Ó. D. Dios, C. Raffaelli\",\"doi\":\"10.1364/JON.7.000487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The impact of burstification delay on the transmission control protocol traffic statistics is presented as well as a new assembly scheme that uses flow window size as the threshold criterion. It is shown that short assembly times are ideally suitable for sources with small congestion windows, allowing for a speedup in their transmission. In addition, large assembly times do not yield any throughput gain, despite the large number of segments per burst transmitted, but result in a low throughput variation, and thus a higher notion of fairness among the individual flows. To this end we propose a new burst assembly scheme that dynamically assigns flows to different assembly queues with different assembly timers, based on their instant window size. Results show that the proposed scheme with different timers provides a higher average throughput together with a smaller variance, which is a good compromise for bandwidth dimensioning.\",\"PeriodicalId\":49154,\"journal\":{\"name\":\"Journal of Optical Networking\",\"volume\":\"7 1\",\"pages\":\"487-495\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1364/JON.7.000487\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Optical Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1364/JON.7.000487\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optical Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/JON.7.000487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

提出了爆发延迟对传输控制协议流量统计的影响,并提出了一种以流窗大小作为阈值准则的装配方案。结果表明,较短的装配时间非常适合具有小拥塞窗口的源,从而允许其传输速度加快。此外,尽管每个突发传输了大量的片段,但大的组装时间不会产生任何吞吐量增益,而是导致低吞吐量变化,从而提高了单个流之间的公平性。为此,我们提出了一种新的突发装配方案,该方案根据流的即时窗口大小,动态地将流分配给具有不同装配定时器的不同装配队列。结果表明,采用不同定时器的方案可提供更高的平均吞吐量和更小的方差,这是对带宽维度的一个很好的折衷。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Window-based burst assembly scheme for TCP traffic over OBS
The impact of burstification delay on the transmission control protocol traffic statistics is presented as well as a new assembly scheme that uses flow window size as the threshold criterion. It is shown that short assembly times are ideally suitable for sources with small congestion windows, allowing for a speedup in their transmission. In addition, large assembly times do not yield any throughput gain, despite the large number of segments per burst transmitted, but result in a low throughput variation, and thus a higher notion of fairness among the individual flows. To this end we propose a new burst assembly scheme that dynamically assigns flows to different assembly queues with different assembly timers, based on their instant window size. Results show that the proposed scheme with different timers provides a higher average throughput together with a smaller variance, which is a good compromise for bandwidth dimensioning.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信