{"title":"MPTCP中自适应加权拥塞控制的研究","authors":"Min Hu, Jun-Na Gan, Yanhong Guo","doi":"10.1109/ICECENG.2011.6057963","DOIUrl":null,"url":null,"abstract":"As the traditional TCP which has greatly restricted is no longer able to meet the requirements of the existing data transmittal. so Multipath Transport Protocol is proposed. Focus on the issue of fairness on the bottleneck link in multipath transmission, and analyzes the limitations of the algorithms of EWTCP with equal round-trip time, We investigate a congestion control scheme that addresses this problem with the adaptive weighted congestion control approach(AWTCP). In our scheme, an According to the simulation experiments by NS2 show that when RTT changes, AWTCP algorithm also able to adaptive changes the weight to each sub-flow, end-to-end connection that uses flows along multiple paths can fairly compete with TCP flows at the shared bottleneck.","PeriodicalId":6336,"journal":{"name":"2011 International Conference on Electrical and Control Engineering","volume":"72 1","pages":"1350-1353"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The research of adaptive weighted congestion control in MPTCP\",\"authors\":\"Min Hu, Jun-Na Gan, Yanhong Guo\",\"doi\":\"10.1109/ICECENG.2011.6057963\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the traditional TCP which has greatly restricted is no longer able to meet the requirements of the existing data transmittal. so Multipath Transport Protocol is proposed. Focus on the issue of fairness on the bottleneck link in multipath transmission, and analyzes the limitations of the algorithms of EWTCP with equal round-trip time, We investigate a congestion control scheme that addresses this problem with the adaptive weighted congestion control approach(AWTCP). In our scheme, an According to the simulation experiments by NS2 show that when RTT changes, AWTCP algorithm also able to adaptive changes the weight to each sub-flow, end-to-end connection that uses flows along multiple paths can fairly compete with TCP flows at the shared bottleneck.\",\"PeriodicalId\":6336,\"journal\":{\"name\":\"2011 International Conference on Electrical and Control Engineering\",\"volume\":\"72 1\",\"pages\":\"1350-1353\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Electrical and Control Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECENG.2011.6057963\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Electrical and Control Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECENG.2011.6057963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The research of adaptive weighted congestion control in MPTCP
As the traditional TCP which has greatly restricted is no longer able to meet the requirements of the existing data transmittal. so Multipath Transport Protocol is proposed. Focus on the issue of fairness on the bottleneck link in multipath transmission, and analyzes the limitations of the algorithms of EWTCP with equal round-trip time, We investigate a congestion control scheme that addresses this problem with the adaptive weighted congestion control approach(AWTCP). In our scheme, an According to the simulation experiments by NS2 show that when RTT changes, AWTCP algorithm also able to adaptive changes the weight to each sub-flow, end-to-end connection that uses flows along multiple paths can fairly compete with TCP flows at the shared bottleneck.