数据和流应用的加性增加平滑减少(AISD)策略

Sivakumar Bakthavachalu, Steven Bassi, Xu Jianxuan, M. Labrador
{"title":"数据和流应用的加性增加平滑减少(AISD)策略","authors":"Sivakumar Bakthavachalu, Steven Bassi, Xu Jianxuan, M. Labrador","doi":"10.1109/PCCC.2007.358876","DOIUrl":null,"url":null,"abstract":"Voice over IP and video applications continue to increase the amount of real-time traffic over the Internet. These applications utilize the UDP protocol because TCP is not suitable for streaming applications since its congestion control mechanism can change the connection's transmission rate drastically, affecting the user-perceived quality of the transmission. Nonetheless, the use of end-to-end flow and congestion control mechanisms for streaming applications has been acknowledged as an important measure to ease or eliminate the congestion collapse problem in the Internet, and the unfairness problem that exist when TCP and UDP share the same congested bottleneck link. In this paper, we propose the smooth fair TCP SACK-based (SF-SACK) protocol to address these problems. SF-SACK implements the well-known end-to-end window-based congestion control algorithm of TCP but uses an additive increase smooth decrease (AISD) strategy that considers history in the evolution of the congestion window. Through simulations and experimentation, we show that if SF-SACK is used by both streaming and data-oriented applications, streaming applications receive a smooth service, and fairness is achieved. If SF-SACK is used for streaming applications only, it is unfair to TCP (not TCP-friendly) but substantially fairer and beneficial than UDP.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Additive Increase Smooth Decrease (AISD) Strategy for Data and Streaming Applications\",\"authors\":\"Sivakumar Bakthavachalu, Steven Bassi, Xu Jianxuan, M. Labrador\",\"doi\":\"10.1109/PCCC.2007.358876\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Voice over IP and video applications continue to increase the amount of real-time traffic over the Internet. These applications utilize the UDP protocol because TCP is not suitable for streaming applications since its congestion control mechanism can change the connection's transmission rate drastically, affecting the user-perceived quality of the transmission. Nonetheless, the use of end-to-end flow and congestion control mechanisms for streaming applications has been acknowledged as an important measure to ease or eliminate the congestion collapse problem in the Internet, and the unfairness problem that exist when TCP and UDP share the same congested bottleneck link. In this paper, we propose the smooth fair TCP SACK-based (SF-SACK) protocol to address these problems. SF-SACK implements the well-known end-to-end window-based congestion control algorithm of TCP but uses an additive increase smooth decrease (AISD) strategy that considers history in the evolution of the congestion window. Through simulations and experimentation, we show that if SF-SACK is used by both streaming and data-oriented applications, streaming applications receive a smooth service, and fairness is achieved. If SF-SACK is used for streaming applications only, it is unfair to TCP (not TCP-friendly) but substantially fairer and beneficial than UDP.\",\"PeriodicalId\":356565,\"journal\":{\"name\":\"2007 IEEE International Performance, Computing, and Communications Conference\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Performance, Computing, and Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2007.358876\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Performance, Computing, and Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2007.358876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

IP语音和视频应用继续增加互联网上的实时通信量。这些应用程序使用UDP协议,因为TCP不适合流应用程序,因为它的拥塞控制机制可以大幅改变连接的传输速率,影响用户感知的传输质量。尽管如此,在流应用程序中使用端到端流量和拥塞控制机制已被认为是缓解或消除互联网中的拥塞崩溃问题以及TCP和UDP共享相同拥塞瓶颈链路时存在的不公平问题的重要措施。在本文中,我们提出了一种平滑公平的基于TCP sack (SF-SACK)协议来解决这些问题。SF-SACK实现了著名的TCP端到端基于窗口的拥塞控制算法,但使用了在拥塞窗口演化过程中考虑历史的加性增加平滑减少(AISD)策略。通过仿真和实验,我们表明,如果流和面向数据的应用都使用SF-SACK,流应用可以获得平滑的服务,并且实现了公平性。如果SF-SACK只用于流应用程序,它对TCP是不公平的(不是TCP友好的),但实质上比UDP更公平和有益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Additive Increase Smooth Decrease (AISD) Strategy for Data and Streaming Applications
Voice over IP and video applications continue to increase the amount of real-time traffic over the Internet. These applications utilize the UDP protocol because TCP is not suitable for streaming applications since its congestion control mechanism can change the connection's transmission rate drastically, affecting the user-perceived quality of the transmission. Nonetheless, the use of end-to-end flow and congestion control mechanisms for streaming applications has been acknowledged as an important measure to ease or eliminate the congestion collapse problem in the Internet, and the unfairness problem that exist when TCP and UDP share the same congested bottleneck link. In this paper, we propose the smooth fair TCP SACK-based (SF-SACK) protocol to address these problems. SF-SACK implements the well-known end-to-end window-based congestion control algorithm of TCP but uses an additive increase smooth decrease (AISD) strategy that considers history in the evolution of the congestion window. Through simulations and experimentation, we show that if SF-SACK is used by both streaming and data-oriented applications, streaming applications receive a smooth service, and fairness is achieved. If SF-SACK is used for streaming applications only, it is unfair to TCP (not TCP-friendly) but substantially fairer and beneficial than UDP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信