CSS: Cautious Slow Start algorithm to minimize packet drop rate

C. Swapna, M. Tahiliani
{"title":"CSS: Cautious Slow Start algorithm to minimize packet drop rate","authors":"C. Swapna, M. Tahiliani","doi":"10.1109/ANTS.2016.7947825","DOIUrl":null,"url":null,"abstract":"Slow Start algorithm helps the TCP flows to quickly ramp up their congestion window (cwnd) by employing an exponential increase pattern. This pattern of increasing cwnd leads to consecutive loss of packets in bulk, and hence, results in large number of packets being re-transmitted. Recently, the limitations of this approach have become apparent as many Internet applications are becoming more sensitive to packet loss and latency. In this paper, we propose a Cautious Slow Start (CSS) algorithm which aims to mitigate the bulk packet losses that occur with the traditional Slow Start algorithm. This is achieved by increasing the cwnd cautiously, instead of doubling it. We validate the effectiveness of CSS algorithm by simulating a variety of Internet like scenarios in ns-2, and comparing its performance with that of the traditional Slow Start algorithm. CSS algorithm successfully mitigates the bulk packet losses, without affecting the overall link and buffer utilization.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2016.7947825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Slow Start algorithm helps the TCP flows to quickly ramp up their congestion window (cwnd) by employing an exponential increase pattern. This pattern of increasing cwnd leads to consecutive loss of packets in bulk, and hence, results in large number of packets being re-transmitted. Recently, the limitations of this approach have become apparent as many Internet applications are becoming more sensitive to packet loss and latency. In this paper, we propose a Cautious Slow Start (CSS) algorithm which aims to mitigate the bulk packet losses that occur with the traditional Slow Start algorithm. This is achieved by increasing the cwnd cautiously, instead of doubling it. We validate the effectiveness of CSS algorithm by simulating a variety of Internet like scenarios in ns-2, and comparing its performance with that of the traditional Slow Start algorithm. CSS algorithm successfully mitigates the bulk packet losses, without affecting the overall link and buffer utilization.
CSS:谨慎慢启动算法,最大限度地降低丢包率
慢启动算法通过采用指数增长模式帮助TCP流快速增加其拥塞窗口(cwnd)。这种增加cwnd的模式导致连续大量丢失数据包,因此导致大量数据包被重新传输。最近,随着许多Internet应用程序对数据包丢失和延迟变得越来越敏感,这种方法的局限性变得越来越明显。在本文中,我们提出了一种谨慎慢启动(CSS)算法,旨在减少传统慢启动算法中出现的大量数据包丢失。这是通过谨慎地增加cwnd而不是加倍来实现的。我们通过在ns-2中模拟各种类似互联网的场景来验证CSS算法的有效性,并将其与传统慢启动算法的性能进行比较。CSS算法在不影响整体链路利用率和缓冲区利用率的情况下,成功地减少了大量丢包。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信