{"title":"TCP中的并发处理","authors":"Yu Dong, N. Pissinou, Jian Wang","doi":"10.1109/CNSR.2007.23","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an extension to current TCP protocol named concurrent TCP (cTCP), which can improve throughput of connections through balancing traffic load on multiple end-to-end paths. We keep the single-sliding-window architecture of TCP untouched for compatibility reasons. The two core components of the design are a packet scheduling switch that balances load among paths, and a duplicated acknowledgement classifier that handles packet reordering. We implemented our protocol in FreeBSD kernel and compared the performance of cTCP with theoretical results. Experiment outcomes show that throughputs of our protocol are close to the ideal values.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"137 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Concurrency Handling in TCP\",\"authors\":\"Yu Dong, N. Pissinou, Jian Wang\",\"doi\":\"10.1109/CNSR.2007.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an extension to current TCP protocol named concurrent TCP (cTCP), which can improve throughput of connections through balancing traffic load on multiple end-to-end paths. We keep the single-sliding-window architecture of TCP untouched for compatibility reasons. The two core components of the design are a packet scheduling switch that balances load among paths, and a duplicated acknowledgement classifier that handles packet reordering. We implemented our protocol in FreeBSD kernel and compared the performance of cTCP with theoretical results. Experiment outcomes show that throughputs of our protocol are close to the ideal values.\",\"PeriodicalId\":266936,\"journal\":{\"name\":\"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)\",\"volume\":\"137 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNSR.2007.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2007.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we propose an extension to current TCP protocol named concurrent TCP (cTCP), which can improve throughput of connections through balancing traffic load on multiple end-to-end paths. We keep the single-sliding-window architecture of TCP untouched for compatibility reasons. The two core components of the design are a packet scheduling switch that balances load among paths, and a duplicated acknowledgement classifier that handles packet reordering. We implemented our protocol in FreeBSD kernel and compared the performance of cTCP with theoretical results. Experiment outcomes show that throughputs of our protocol are close to the ideal values.