{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:18Z","timestamp":1750306158276,"version":"3.41.0"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,8,2]],"date-time":"2016-08-02T00:00:00Z","timestamp":1470096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["608533"],"award-info":[{"award-number":["608533"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cisco","award":["Ciscos Chair N ETWORKS FOR THE F UTURE"],"award-info":[{"award-number":["Ciscos Chair N ETWORKS FOR THE F UTURE"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2016,9,21]]},"abstract":"<jats:p>\n            Recently, a negative interplay has been shown to arise when scheduling\/Active Queue Management (AQM) techniques and low-priority congestion control protocols are used together; namely, AQM resets the relative level of priority among congestion control protocols. This work explores this issue by carrying out a control-theoretic analysis of the dynamical system to prove some fundamental properties that fully characterize the reprioritization phenomenon. In particular, (i) we provide the closed-form solution of the equilibrium in the open loop (i.e., fixing a target loss probability\n            <jats:italic>p<\/jats:italic>\n            ); (ii) we provide a stability analysis and a characterization of the reprioritization phenomenon when closing the loop with AQM (i.e., that dynamically adjusts the system loss probability). Our results are important as the characterization of the reprioritization phenomenon is not only quantitatively accurate for the specific protocols and AQM considered but also qualitatively accurate for a broader range of congestion control protocol and AQM combinations. Finally, while we find a sufficient condition to avoid the reprioritization phenomenon, we also show, at the same time, such conditions to be likely impractical: Therefore, we propose a simple and practical system-level solution that is able to reinstate priorities among protocols.\n          <\/jats:p>","DOI":"10.1145\/2934652","type":"journal-article","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T13:26:34Z","timestamp":1470317194000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Control-Theoretic Analysis of Low-Priority Congestion Control Reprioritization under AQM"],"prefix":"10.1145","volume":"1","author":[{"given":"Luca De","family":"Cicco","sequence":"first","affiliation":[{"name":"Politecnico di Bari, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixi","family":"Gong","sequence":"additional","affiliation":[{"name":"Telecom ParisTech, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Rossi","sequence":"additional","affiliation":[{"name":"LTCI UMR5141, Telecom ParisTech, Universit\u00e9 Paris Saclay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/217391.217431"},{"key":"e_1_2_1_2_1","first-page":"1788","article-title":"Analytical estimation of completion times of mixed NewReno and Tahoe TCP connections over single and multiple bottleneck networks","volume":"3","author":"Alessio E.","year":"2001","unstructured":"E. Alessio , M. Garetto , R. Lo Cigno , Michela Meo , and M. Ajmone Marsan . 2001 . Analytical estimation of completion times of mixed NewReno and Tahoe TCP connections over single and multiple bottleneck networks . In IEEE GLOBECOM , Vol. 3. 1788 -- 1793 . E. Alessio, M. Garetto, R. Lo Cigno, Michela Meo, and M. Ajmone Marsan. 2001. Analytical estimation of completion times of mixed NewReno and Tahoe TCP connections over single and multiple bottleneck networks. In IEEE GLOBECOM, Vol. 3. 1788--1793.","journal-title":"IEEE GLOBECOM"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.923940"},{"key":"e_1_2_1_4_1","volume-title":"Proc. ISOC Workshop on Reducing Internet Latency.","author":"Benameur Nabil","year":"2013","unstructured":"Nabil Benameur , Fabrice Guillemin , and Luca Muscariello . 2013 . Latency reduction in home access gateways with shortest queue first . In Proc. ISOC Workshop on Reducing Internet Latency. Nabil Benameur, Fabrice Guillemin, and Luca Muscariello. 2013. Latency reduction in home access gateways with shortest queue first. In Proc. ISOC Workshop on Reducing Internet Latency."},{"key":"e_1_2_1_5_1","unstructured":"Maxime Bizon. 2005. {Nouveaux Firmwares Freebox V3 & V4} ADUF - Historique Firmware 01\/07\/2005. Technical Report. Blog post available online at http:\/\/88.191.250.12\/viewtopic.php?t&equals;164746&view&equals;&equals;previous.  Maxime Bizon. 2005. {Nouveaux Firmwares Freebox V3 & V4} ADUF - Historique Firmware 01\/07\/2005. Technical Report. Blog post available online at http:\/\/88.191.250.12\/viewtopic.php?t&equals;164746&view&equals;&equals;previous."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2010.5735831"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"G. Carofiglio L. Muscariello D. Rossi C. Testa and S. Valenti. 2013. Rethinking low extra delay backtround transport protocols. Elsevier Computer Networks (2013) 1838--1852.  G. Carofiglio L. Muscariello D. Rossi C. Testa and S. Valenti. 2013. Rethinking low extra delay backtround transport protocols. Elsevier Computer Networks (2013) 1838--1852.","DOI":"10.1016\/j.comnet.2013.02.020"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"G. Carofiglio L. Muscariello D. Rossi and S. Valenti. 2010b. The quest for LEDBAT fairness. In IEEE GLOBECOM. 1--6.  G. Carofiglio L. Muscariello D. Rossi and S. Valenti. 2010b. The quest for LEDBAT fairness. In IEEE GLOBECOM. 1--6.","DOI":"10.1109\/GLOCOM.2010.5683559"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(99)00029-2"},{"key":"e_1_2_1_10_1","unstructured":"B. Cohen. 2011. How has BitTorrent as a protocol evolved over time. http:\/\/www.quora.com\/BitTorrent-protocol-company. (2011).  B. Cohen. 2011. How has BitTorrent as a protocol evolved over time. http:\/\/www.quora.com\/BitTorrent-protocol-company. (2011)."},{"volume-title":"9th USENIX International Workshop on Peer-to-Peer Systems (IPTPS\u201910)","author":"Cohen B.","key":"e_1_2_1_11_1","unstructured":"B. Cohen and A. Norberg . 2010. Correcting for clock drift in uTP and LEDBAT . In 9th USENIX International Workshop on Peer-to-Peer Systems (IPTPS\u201910) . B. Cohen and A. Norberg. 2010. Correcting for clock drift in uTP and LEDBAT. In 9th USENIX International Workshop on Peer-to-Peer Systems (IPTPS\u201910)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.120719"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.02.036"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"volume-title":"Proceedings of the 23rd International Teletraffic Congress (ITC23)","author":"Eshete A.","key":"e_1_2_1_15_1","unstructured":"A. Eshete and Y. Jiang . 2011. Approximate fairness through limited flow list . In Proceedings of the 23rd International Teletraffic Congress (ITC23) . 198--205. A. Eshete and Y. Jiang. 2011. Approximate fairness through limited flow list. In Proceedings of the 23rd International Teletraffic Congress (ITC23). 198--205."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402599.2402605"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/122431.122434"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.413212"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063176.2063196"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITC.2013.6662942"},{"volume-title":"IEEE INFOCOM Workshop on Traffic Measurement and Analysis (TMA\u201913)","author":"Gong Y.","key":"e_1_2_1_22_1","unstructured":"Y. Gong , D. Rossi , C. Testa , S. Valenti , and D. Taht . 2013b. Fighting the bufferbloat: On the coexistence of AQM and low priority congestion control . In IEEE INFOCOM Workshop on Traffic Measurement and Analysis (TMA\u201913) . Turin, Italy. Y. Gong, D. Rossi, C. Testa, S. Valenti, and D. Taht. 2013b. Fighting the bufferbloat: On the coexistence of AQM and low priority congestion control. In IEEE INFOCOM Workshop on Traffic Measurement and Analysis (TMA\u201913). Turin, Italy."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.bjp.2014.01.009"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997155"},{"volume-title":"Theory and Applications of Hopf Bifurcation","author":"Hassard Brian D.","key":"e_1_2_1_25_1","unstructured":"Brian D. Hassard , Nicholas D. Kazarinoff , and Yieh-Hei Wan . 1981. Theory and Applications of Hopf Bifurcation . Vol. 41 . CUP Archive . Brian D. Hassard, Nicholas D. Kazarinoff, and Yieh-Hei Wan. 1981. Theory and Applications of Hopf Bifurcation. Vol. 41. CUP Archive."},{"key":"e_1_2_1_26_1","volume-title":"IEEE INFOCOM\u201901","volume":"3","author":"Hollot C. V.","unstructured":"C. V. Hollot , V. Misra , D. Towsley , and W. Gong . 2001. A control theoretic analysis of RED . In IEEE INFOCOM\u201901 , Vol. 3 . 1510--1519. C. V. Hollot, V. Misra, D. Towsley, and W. Gong. 2001. A control theoretic analysis of RED. In IEEE INFOCOM\u201901, Vol. 3. 1510--1519."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.08.018"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398810"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005703"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879173"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2630088.2630094"},{"key":"e_1_2_1_32_1","unstructured":"A. Kuzmanovic and E. W. Knightly. 2003. TCP-LP: A distributed algorithm for low priority data transfer. In IEEE INFOCOM.  A. Kuzmanovic and E. W. Knightly. 2003. TCP-LP: A distributed algorithm for low priority data transfer. In IEEE INFOCOM."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.832461"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"S. Liu M. Vojnovic and D. Gunawardena. 2006. 4cp: Competitive and considerate congestion control protocol. In ACM SIGCOMM.  S. Liu M. Vojnovic and D. Gunawardena. 2006. 4cp: Competitive and considerate congestion control protocol. In ACM SIGCOMM.","DOI":"10.1109\/IWQOS.2007.376542"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/885651.781039"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.860102"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(99)00128-4"},{"volume-title":"Stochastic fairness queueing","author":"McKenney Paul","key":"e_1_2_1_38_1","unstructured":"Paul McKenney . 1990. Stochastic fairness queueing . In IEEE INFOCOM. Paul McKenney. 1990. Stochastic fairness queueing. In IEEE INFOCOM."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2010.0752"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207170600810701"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347421"},{"key":"e_1_2_1_42_1","volume-title":"IETF","author":"Nagle John","year":"1985","unstructured":"John Nagle . 1985. On packet switches with infinite storage. RFC 970 , IETF ( 1985 ). John Nagle. 1985. On packet switches with infinite storage. RFC 970, IETF (1985)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096782"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2209249.2209264"},{"key":"e_1_2_1_45_1","volume-title":"SIAM: Philadelphia, PA.","author":"Niculescu S.-I.","year":"2007","unstructured":"S.-I. Niculescu and W. Michiels . 2007 . Stability and Stabilization of Time-Delay Systems. An Eigenvalue-Based Approach . SIAM: Philadelphia, PA. S.-I. Niculescu and W. Michiels. 2007. Stability and Stabilization of Time-Delay Systems. An Eigenvalue-Based Approach. SIAM: Philadelphia, PA."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2013.6602305"},{"key":"e_1_2_1_47_1","unstructured":"R. Pan B. Prabhakar and K. Psounis. 2000. Choke - A stateless active queue management scheme for approximating fair bandwidth allocation. In IEEE INFOCOM.  R. Pan B. Prabhakar and K. Psounis. 2000. Choke - A stateless active queue management scheme for approximating fair bandwidth allocation. In IEEE INFOCOM."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.298432"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110510"},{"key":"e_1_2_1_50_1","volume-title":"LEDBAT: Playing with the new BitTorrent congestion control algorithm. In PAM.","author":"Rossi D.","year":"2010","unstructured":"D. Rossi , C. Testa , and S. Valenti . 2010 a. Yes , we LEDBAT: Playing with the new BitTorrent congestion control algorithm. In PAM. D. Rossi, C. Testa, and S. Valenti. 2010a. Yes, we LEDBAT: Playing with the new BitTorrent congestion control algorithm. In PAM."},{"key":"e_1_2_1_51_1","volume-title":"LEDBAT: The new BitTorrent congestion control protocol","author":"Rossi D.","year":"2010","unstructured":"D. Rossi , C. Testa , S. Valenti , and L. Muscariello . 2010 b. LEDBAT: The new BitTorrent congestion control protocol . In IEEE ICCCN. D. Rossi, C. Testa, S. Valenti, and L. Muscariello. 2010b. LEDBAT: The new BitTorrent congestion control protocol. In IEEE ICCCN."},{"volume-title":"Global Internet Phenomena Report (1H","year":"2014","key":"e_1_2_1_52_1","unstructured":"Sandvine. 2014. Global Internet Phenomena Report (1H 2014 ). https:\/\/www.sandvine.com\/downloads\/general\/global-internet-phenomena\/2014\/1h-2014-global-internet-phenomena-report.pdf. (2014). Sandvine. 2014. Global Internet Phenomena Report (1H 2014). https:\/\/www.sandvine.com\/downloads\/general\/global-internet-phenomena\/2014\/1h-2014-global-internet-phenomena-report.pdf. (2014)."},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"J. Schneider J. Wagner R. Winter and H. J. Kolbe. 2010. Out of my way -- Evaluating low extra delay background transport in an ADSL access network. In ITC22.  J. Schneider J. Wagner R. Winter and H. J. Kolbe. 2010. Out of my way -- Evaluating low extra delay background transport in an ADSL access network. In ITC22.","DOI":"10.1109\/ITC.2010.5608714"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"S. Shalunov G. Hazel J. Iyengar and M. Kuehlewin. 2012. Low Extra Delay Background Transport (LEDBAT). IETF RFC 6817. (2012).  S. Shalunov G. Hazel J. Iyengar and M. Kuehlewin. 2012. Low Extra Delay Background Transport (LEDBAT). IETF RFC 6817. (2012).","DOI":"10.17487\/rfc6817"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/217382.217453"},{"key":"e_1_2_1_56_1","volume-title":"IEEE International Conference on Communications (ICC). 1216--1221","author":"Viet Trang Si Quoc","year":"2014","unstructured":"Si Quoc Viet Trang , N. Kuhn , E. Lochin , C. Baudoin , E. Dubois , and P. Gelard . 2014. On the existence of optimal LEDBAT parameters . In IEEE International Conference on Communications (ICC). 1216--1221 . DOI:http:\/\/dx.doi.org\/10.1109\/ICC. 2014 .6883487 10.1109\/ICC.2014.6883487 Si Quoc Viet Trang, N. Kuhn, E. Lochin, C. Baudoin, E. Dubois, and P. Gelard. 2014. On the existence of optimal LEDBAT parameters. In IEEE International Conference on Communications (ICC). 1216--1221. DOI:http:\/\/dx.doi.org\/10.1109\/ICC.2014.6883487"},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"A. Venkataramani R. Kokku and M. Dahlin. 2002. TCP nice: A mechanism for background transfers. In USENIX OSDI.   A. Venkataramani R. Kokku and M. Dahlin. 2002. TCP nice: A mechanism for background transfers. In USENIX OSDI.","DOI":"10.1145\/1060289.1060320"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2934652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:47Z","timestamp":1750217987000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,2]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,9,21]]}},"alternative-id":["10.1145\/2934652"],"URL":"https:\/\/doi.org\/10.1145\/2934652","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2016,8,2]]},"assertion":[{"value":"2015-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}