{"title":"用于高速因特网的吞吐量无死锁的TCP","authors":"R. Chang, H. Y. Chan","doi":"10.1109/ICON.2000.875773","DOIUrl":null,"url":null,"abstract":"Throughput deadlocks were observed when TCP was operated on high-speed networks. This deadlock problem is caused by the interaction of the sender-side and receiver-side silly window syndrome avoidance algorithms, because a TCP connection's maximum segment size is no longer small on the high-speed Internet when compared with the send and receive socket buffer sizes. We propose a new congestion-sensitive, adaptive acknowledgment algorithm (CS-AAA) to solve the deadlock problem. Unlike our previously proposed AAA, the CS-AAA is able to respond to and to recover from congestion much faster than AAA. The CS-AAA solves this problem by detecting congestion, and performing a slow-start-like mechanism. Extensive simulation results support that CS-AAA's throughput performance significantly exceeds that of AAA, especially when the send buffer size is relatively large.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":" 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A throughput deadlock-free TCP for high-speed Internet\",\"authors\":\"R. Chang, H. Y. Chan\",\"doi\":\"10.1109/ICON.2000.875773\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Throughput deadlocks were observed when TCP was operated on high-speed networks. This deadlock problem is caused by the interaction of the sender-side and receiver-side silly window syndrome avoidance algorithms, because a TCP connection's maximum segment size is no longer small on the high-speed Internet when compared with the send and receive socket buffer sizes. We propose a new congestion-sensitive, adaptive acknowledgment algorithm (CS-AAA) to solve the deadlock problem. Unlike our previously proposed AAA, the CS-AAA is able to respond to and to recover from congestion much faster than AAA. The CS-AAA solves this problem by detecting congestion, and performing a slow-start-like mechanism. Extensive simulation results support that CS-AAA's throughput performance significantly exceeds that of AAA, especially when the send buffer size is relatively large.\",\"PeriodicalId\":191244,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"volume\":\" 10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2000.875773\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875773","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A throughput deadlock-free TCP for high-speed Internet
Throughput deadlocks were observed when TCP was operated on high-speed networks. This deadlock problem is caused by the interaction of the sender-side and receiver-side silly window syndrome avoidance algorithms, because a TCP connection's maximum segment size is no longer small on the high-speed Internet when compared with the send and receive socket buffer sizes. We propose a new congestion-sensitive, adaptive acknowledgment algorithm (CS-AAA) to solve the deadlock problem. Unlike our previously proposed AAA, the CS-AAA is able to respond to and to recover from congestion much faster than AAA. The CS-AAA solves this problem by detecting congestion, and performing a slow-start-like mechanism. Extensive simulation results support that CS-AAA's throughput performance significantly exceeds that of AAA, especially when the send buffer size is relatively large.