{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:12:32Z","timestamp":1761401552327,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2011,4,15]],"date-time":"2011-04-15T00:00:00Z","timestamp":1302825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2011,4,15]]},"abstract":"<jats:p>Many papers explain the drop of download performance when two TCP connections in opposite directions share a common bottleneck link by ACK compression, the phenomenon in which download ACKs arrive in bursts so that TCP self clocking breaks. Efficient mechanisms to cope with the performance problem exist and we do not consider proposing yet another solution. We rather thoroughly analyze the interactions between connections and show that actually ACK compression only arises in a perfectly symmetrical setup and it has little impact on performance. We provide a different explanation of the interactions---data pendulum, a core phenomenon that we analyze in this paper. In the data pendulum effect, data and ACK segments alternately fill only one of the link buffers (on the upload or download side) at a time, but almost never both of them. We analyze the effect in the case in which buffers are structured as arrays of bytes and derive an expression for the ratio between the download and upload throughput. Simulation results and measurements confirm our analysis and show how appropriate buffer sizing alleviates performance degradation. We also consider the case of buffers structured as arrays of packets and show that it amplifies the effects of data pendulum.<\/jats:p>","DOI":"10.1145\/1971162.1971164","type":"journal-article","created":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T12:45:10Z","timestamp":1303217110000},"page":"5-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Two-way TCP connections"],"prefix":"10.1145","volume":"41","author":[{"given":"Martin","family":"Heusse","sequence":"first","affiliation":[{"name":"CNRS Grenoble Informatics Laboratory UMR 5217, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sears A.","family":"Merritt","sequence":"additional","affiliation":[{"name":"University of Colorado at Boulder, Boulder, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy X.","family":"Brown","sequence":"additional","affiliation":[{"name":"University of Colorado at Boulder, Boulder, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Duda","sequence":"additional","affiliation":[{"name":"CNRS Grenoble Informatics Laboratory UMR 5217, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,4,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/381906.381931"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/115994.116006"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/122419.122422"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.748085"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/277858.277877"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019155000496"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"H. Balakrishnan V. Padmanabhan G. Fairhurst and M. Sooriyabandara. RFC 3449 TCP Performance Implications of Network Path Asymmetry. http:\/\/tools.ietf.org\/html\/rfc3449 December 2002.  H. Balakrishnan V. Padmanabhan G. Fairhurst and M. Sooriyabandara. RFC 3449 TCP Performance Implications of Network Path Asymmetry. http:\/\/tools.ietf.org\/html\/rfc3449 December 2002.","DOI":"10.17487\/rfc3449"},{"key":"e_1_2_1_8_1","first-page":"233","volume-title":"7th IEEE International Conference on High Speed Networks and Multimedia Communications HSNMC'04, number 3079 in LNCS","author":"Louati Fatma","year":"2004","unstructured":"Fatma Louati , Chadi Barakat , and Walid Dabbous . Handling Two-Way TCP Traffic in Asymmetric Networks . In 7th IEEE International Conference on High Speed Networks and Multimedia Communications HSNMC'04, number 3079 in LNCS , pages 233 -- 243 . Springer-Verlag , 2004 . Fatma Louati, Chadi Barakat, and Walid Dabbous. Handling Two-Way TCP Traffic in Asymmetric Networks. In 7th IEEE International Conference on High Speed Networks and Multimedia Communications HSNMC'04, number 3079 in LNCS, pages 233--243. Springer-Verlag, 2004."},{"key":"e_1_2_1_9_1","volume-title":"Optimization of TCP\/IP Traffic Across Shared ADSL. Master's thesis","author":"Brouer Jesper Dangaard","year":"2005","unstructured":"Jesper Dangaard Brouer . Optimization of TCP\/IP Traffic Across Shared ADSL. Master's thesis , University of Copenhagen , 2005 . Jesper Dangaard Brouer. Optimization of TCP\/IP Traffic Across Shared ADSL. Master's thesis, University of Copenhagen, 2005."},{"key":"e_1_2_1_10_1","volume-title":"10th Symposium on Performance Evaluation of Computer and Telecommunications Systems (SPECTS 2007","author":"Collange Denis","year":"2007","unstructured":"Denis Collange . Performance model of opposite TCP connections on asymmetric capacities . In 10th Symposium on Performance Evaluation of Computer and Telecommunications Systems (SPECTS 2007 ), San Diego (USA-CA ), July 2007 . Denis Collange. Performance model of opposite TCP connections on asymmetric capacities. In 10th Symposium on Performance Evaluation of Computer and Telecommunications Systems (SPECTS 2007), San Diego (USA-CA), July 2007."},{"key":"e_1_2_1_11_1","unstructured":"Qualnet 5.0.2. Scalable Networks.  Qualnet 5.0.2. Scalable Networks."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1971162.1971164","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1971162.1971164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:52Z","timestamp":1750244752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1971162.1971164"}},"subtitle":["old problem, new insight"],"short-title":[],"issued":{"date-parts":[[2011,4,15]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4,15]]}},"alternative-id":["10.1145\/1971162.1971164"],"URL":"https:\/\/doi.org\/10.1145\/1971162.1971164","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2011,4,15]]},"assertion":[{"value":"2011-04-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}