Sivakumar Bakthavachalu, Steven Bassi, Xu Jianxuan, M. Labrador
{"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}
引用次数: 4
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.