Kai Chen, Hongyun Zheng, Yongxiang Zhao, Yuchun Guo
{"title":"Improved Solution to TCP Incast Problem in Data Center Networks","authors":"Kai Chen, Hongyun Zheng, Yongxiang Zhao, Yuchun Guo","doi":"10.1109/CyberC.2012.78","DOIUrl":null,"url":null,"abstract":"TCP in cast refers to a throughput collapse when too many senders simultaneously transmit to the same receiver. In order to improve throughput, our idea is avoiding packet losses before TCP in cast happens. The scheme is limiting the number of concurrent senders such that the link can be filled as fully as possible but no packet losses. In this paper we re-examine and modify the condition that the link can be saturated but no packet losses, which initially presented in our previous work. Then based on the modified condition we propose an improved approach to determining the number of concurrent senders. Analysis and simulation results show this improved approach avoids TCP in cast and obtains more throughput improvement than the previous approach.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"391 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2012.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
TCP in cast refers to a throughput collapse when too many senders simultaneously transmit to the same receiver. In order to improve throughput, our idea is avoiding packet losses before TCP in cast happens. The scheme is limiting the number of concurrent senders such that the link can be filled as fully as possible but no packet losses. In this paper we re-examine and modify the condition that the link can be saturated but no packet losses, which initially presented in our previous work. Then based on the modified condition we propose an improved approach to determining the number of concurrent senders. Analysis and simulation results show this improved approach avoids TCP in cast and obtains more throughput improvement than the previous approach.