N. Moller, C. Barakat, Konstantin Avrachenkov, E. Altman
{"title":"TCP New Reno和TCP Westwood之间的协议间公平性","authors":"N. Moller, C. Barakat, Konstantin Avrachenkov, E. Altman","doi":"10.1109/NGI.2007.371207","DOIUrl":null,"url":null,"abstract":"In this paper we investigate the effect of introducing TCP Westwood+ on regular TCP New Reno. By means of analytical modeling and ns-2 simulations, we demonstrate that the two protocols get different shares of the available bandwidth in the network. Our main result is that the bandwidth sharing between the two protocols depends on one crucial parameter: the ratio between the bottleneck router buffer size and the bandwidth delay product. If the ratio is smaller than one, TCP Westwood+ takes more bandwidth. On the contrary, if the ratio is greater than one, it is TCP New Reno which gets the larger part. Inspired by our results, we propose a simple modification to the window decrease algorithm in TCP Westwood+ that solves the unfairness problem for large buffer sizes. For small buffers, the unfairness problem is still open.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Inter-protocol fairness between TCP New Reno and TCP Westwood\",\"authors\":\"N. Moller, C. Barakat, Konstantin Avrachenkov, E. Altman\",\"doi\":\"10.1109/NGI.2007.371207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate the effect of introducing TCP Westwood+ on regular TCP New Reno. By means of analytical modeling and ns-2 simulations, we demonstrate that the two protocols get different shares of the available bandwidth in the network. Our main result is that the bandwidth sharing between the two protocols depends on one crucial parameter: the ratio between the bottleneck router buffer size and the bandwidth delay product. If the ratio is smaller than one, TCP Westwood+ takes more bandwidth. On the contrary, if the ratio is greater than one, it is TCP New Reno which gets the larger part. Inspired by our results, we propose a simple modification to the window decrease algorithm in TCP Westwood+ that solves the unfairness problem for large buffer sizes. For small buffers, the unfairness problem is still open.\",\"PeriodicalId\":207883,\"journal\":{\"name\":\"2007 Next Generation Internet Networks\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Next Generation Internet Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2007.371207\",\"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 Next Generation Internet Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2007.371207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
摘要
本文研究了引入TCP Westwood+对常规TCP New Reno的影响。通过分析建模和ns-2仿真,我们证明了两种协议在网络中获得不同的可用带宽份额。我们的主要结果是,两个协议之间的带宽共享取决于一个关键参数:瓶颈路由器缓冲区大小与带宽延迟乘积之间的比率。如果该比值小于1,则TCP Westwood+占用更多带宽。相反,如果比率大于1,则TCP New Reno获得较大的部分。受我们研究结果的启发,我们对TCP Westwood+中的窗口减少算法提出了一个简单的修改,解决了大缓冲区大小的不公平问题。对于小缓冲区,不公平问题仍然存在。
Inter-protocol fairness between TCP New Reno and TCP Westwood
In this paper we investigate the effect of introducing TCP Westwood+ on regular TCP New Reno. By means of analytical modeling and ns-2 simulations, we demonstrate that the two protocols get different shares of the available bandwidth in the network. Our main result is that the bandwidth sharing between the two protocols depends on one crucial parameter: the ratio between the bottleneck router buffer size and the bandwidth delay product. If the ratio is smaller than one, TCP Westwood+ takes more bandwidth. On the contrary, if the ratio is greater than one, it is TCP New Reno which gets the larger part. Inspired by our results, we propose a simple modification to the window decrease algorithm in TCP Westwood+ that solves the unfairness problem for large buffer sizes. For small buffers, the unfairness problem is still open.