{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:47:30Z","timestamp":1777902450588,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"10","license":[{"start":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T00:00:00Z","timestamp":1543536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2019,10]]},"abstract":"<jats:p>Most Internet traffic is carried by the Transmission Control Protocol (TCP) nowadays, even in the case of real-time services. Detecting and mitigating the congestion is one of the primary tasks of this protocol, in fact, different TCP versions are defined by their congestion control algorithms. Furthermore, Active Queue Management (AQM) algorithms share the same goal of congestion mitigation with TCP; in particular, the most efficient congestion control occurs when AQM and TCP work together. This paper presents a brief survey and a cross-comparison of the latest and most important TCP and AQM variants, then provides an evaluation of a different kind of performance on the ns-3 network simulator over various types of environments (multiple Round Trip Time, long delay, different congestion levels, etc.). In any shared bottleneck, the choice of the TCP-AQM couple to adopt is crucial. We will show that the results are not univocal and the \u201cone size fits all\u201d solution does not exist. Moreover, the proper couple depends on the performance that we want to boost and on the environment that we have to deal with.<\/jats:p>","DOI":"10.1177\/0037549718814626","type":"journal-article","created":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T09:07:04Z","timestamp":1543568824000},"page":"979-993","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Transmission Control Protocol and Active Queue Management together against congestion: cross-comparison through simulations"],"prefix":"10.1177","volume":"95","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0534-995X","authenticated-orcid":false,"given":"Carlo Augusto","family":"Grazia","sequence":"first","affiliation":[{"name":"Department of Engineering Enzo Ferrari, University of Modena and Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natale","family":"Patriciello","sequence":"additional","affiliation":[{"name":"Centre Tecnol\u00f2gic de Telecomunicacions de Catalunya (CTTC), Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Klapez","sequence":"additional","affiliation":[{"name":"Department of Engineering Enzo Ferrari, University of Modena and Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Casoni","sequence":"additional","affiliation":[{"name":"Department of Engineering Enzo Ferrari, University of Modena and Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2018,11,30]]},"reference":[{"key":"bibr1-0037549718814626","first-page":"1","author":"Chen Y","year":"2016","journal-title":"IEEE Trans Wireless Commun"},{"key":"bibr2-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"bibr3-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.042710.00114"},{"key":"bibr4-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1145\/1400097.1400105"},{"key":"bibr5-0037549718814626","doi-asserted-by":"crossref","unstructured":"Floyd S. Limited slow-start for TCP with large congestion, windows, RFC Editor 2004; RFC 3742.","DOI":"10.17487\/rfc3742"},{"key":"bibr6-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1002\/sat.799"},{"key":"bibr7-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.188"},{"key":"bibr8-0037549718814626","doi-asserted-by":"crossref","unstructured":"Floyd S, Gurtov A, Henderson T. The New Reno modification to TCP\u2019s fast recovery algorithm. RFC Editor 2004; RFC 3782.","DOI":"10.17487\/rfc3782"},{"key":"bibr9-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2000.896302"},{"key":"bibr10-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997155"},{"key":"bibr11-0037549718814626","first-page":"37","volume-title":"proceedings of PFLDnet, ISI","author":"Baiocchi A"},{"key":"bibr12-0037549718814626","unstructured":"Floyd S, Gummadi R, Shenker S, et al. Adaptive red: an algorithm for increasing the robustness of reds active queue management. Epub ahead of print 2001. http:\/\/www.icir.org\/floyd\/papers.html."},{"key":"bibr13-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1145\/2209249.2209264"},{"key":"bibr14-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2002.1188503"},{"key":"bibr15-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2013.6602305"},{"key":"bibr16-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/WiMOB.2015.7347952"},{"key":"bibr17-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/WiMOB.2016.7763180"},{"key":"bibr18-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.02.010"},{"key":"bibr19-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1177\/0037549712469892"},{"key":"bibr20-0037549718814626","first-page":"112","volume-title":"proceedings of the 2015 workshop on Ns-3 (WNS3 \u201915)","author":"Casoni M"},{"key":"bibr21-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2017.09.008"},{"key":"bibr22-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOMW.2015.7134087"},{"key":"bibr23-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2016.03.005"},{"key":"bibr24-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.082212.00018"},{"key":"bibr25-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2320071"},{"key":"bibr26-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/GIIS.2012.6466762"},{"key":"bibr27-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.052213.00088"},{"key":"bibr28-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/NETAPPS.2010.16"},{"key":"bibr29-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510786"},{"key":"bibr30-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510787"},{"key":"bibr31-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2012-1_77"},{"key":"bibr32-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2478456"},{"key":"bibr33-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/IC4.2013.6653752"},{"key":"bibr34-0037549718814626","first-page":"492","volume-title":"2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt)","author":"Rahman H","year":"2013"},{"key":"bibr35-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2448591"},{"key":"bibr36-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2014.6849173"},{"key":"bibr37-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.04.010"},{"key":"bibr38-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.07.013"},{"key":"bibr39-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.07.014"},{"key":"bibr40-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1145\/3150928.3150957"},{"key":"bibr41-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.bjp.2013.11.008"},{"key":"bibr42-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.11.011"},{"key":"bibr43-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/AFIN.2010.22"},{"key":"bibr44-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/ICON.2013.6781990"},{"key":"bibr45-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/TELFOR.2014.7034385"},{"key":"bibr46-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2014686"},{"key":"bibr47-0037549718814626","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900415"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549718814626","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0037549718814626","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549718814626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:29:45Z","timestamp":1777634985000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549718814626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,30]]},"references-count":47,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["10.1177\/0037549718814626"],"URL":"https:\/\/doi.org\/10.1177\/0037549718814626","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,30]]}}}