{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:18:42Z","timestamp":1780053522936,"version":"3.54.0"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"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":[[2020,7,22]]},"abstract":"<jats:p>Buffering architectures and policies for their efficient management are one of the core ingredients of network architecture. However, despite strong incentives to experiment with and deploy new policies, opportunities for changing or automatically choosing anything beyond a few parameters in a predefined set of behaviors still remain very limited. We introduce a novel buffer management framework based on machine learning approaches which automatically adapts to traffic conditions changing over time and requires only limited knowledge from network operators about the dynamics and optimality of desired behaviors. We validate and compare various design options with a comprehensive evaluation study.<\/jats:p>","DOI":"10.1145\/3411740.3411745","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T22:16:55Z","timestamp":1595456215000},"page":"30-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Towards declarative self-adapting buffer management"],"prefix":"10.1145","volume":"50","author":[{"given":"Pavel","family":"Chuprikov","sequence":"first","affiliation":[{"name":"Universit\u00e1 della Svizzera italiana"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergey","family":"Nikolenko","sequence":"additional","affiliation":[{"name":"National Research University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kirill","family":"Kogan","sequence":"additional","affiliation":[{"name":"Ariel University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"[n.d.]. The network simulator --- ns2. http:\/\/www.isi.edu\/nsnam\/ns\/.  [n.d.]. The network simulator --- ns2. http:\/\/www.isi.edu\/nsnam\/ns\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743430"},{"key":"e_1_2_1_3_1","unstructured":"N. Andelman Y. Mansour and A. Zhu. 2003. Competitive queueing policies for QoS switches. In SODA. 761--770.  N. Andelman Y. Mansour and A. Zhu. 2003. Competitive queueing policies for QoS switches. In SODA. 761--770."},{"key":"e_1_2_1_4_1","unstructured":"J. Audibert and S. Bubeck. 2010. Best Arm Identification in Multi-Armed Bandits. In COLT. https:\/\/www.microsoft.com\/en-us\/research\/publication\/best-arm-identification-multi-armed-bandits\/  J. Audibert and S. Bubeck. 2010. Best Arm Identification in Multi-Armed Bandits. In COLT. https:\/\/www.microsoft.com\/en-us\/research\/publication\/best-arm-identification-multi-armed-bandits\/"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.016"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098593.3098597"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"P. Chuprikov S. Nikolenko and K. Kogan. 2015. Priority queueing with multiple packet characteristics. In INFOCOM. 1418--1426.  P. Chuprikov S. Nikolenko and K. Kogan. 2015. Priority queueing with multiple packet characteristics. In INFOCOM. 1418--1426.","DOI":"10.1109\/INFOCOM.2015.7218519"},{"key":"e_1_2_1_12_1","unstructured":"Code for simulations [n.d.]. Code for simulations. https:\/\/github.com\/ccrsubmission\/learning.  Code for simulations [n.d.]. Code for simulations. https:\/\/github.com\/ccrsubmission\/learning."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057015"},{"key":"e_1_2_1_14_1","unstructured":"M. Dong T. Meng D. Zarchy E. Arslan Y. Gilad B. Godfrey and M. Schapira. 2018. PCC Vivace:Online-Learning Congestion Control. In NSDI. 343--356. https:\/\/www.usenix.org\/conference\/nsdi18\/presentation\/dong  M. Dong T. Meng D. Zarchy E. Arslan Y. Gilad B. Godfrey and M. Schapira. 2018. PCC Vivace:Online-Learning Congestion Control. In NSDI. 343--356. https:\/\/www.usenix.org\/conference\/nsdi18\/presentation\/dong"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-018-0564-2"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486003"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034574.2034812"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2892806"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354568"},{"key":"e_1_2_1_21_1","volume-title":"Non-stochastic Best Arm Identification and Hyperparameter Optimization. In AISTATS","volume":"51","author":"Jamieson K.","unstructured":"K. Jamieson and A. Talwalkar . 2016 . Non-stochastic Best Arm Identification and Hyperparameter Optimization. In AISTATS , Vol. 51 . Cadiz, Spain, 240--248. http:\/\/proceedings.mlr.press\/v51\/jamieson16.html K. Jamieson and A. Talwalkar. 2016. Non-stochastic Best Arm Identification and Hyperparameter Optimization. In AISTATS, Vol. 51. Cadiz, Spain, 240--248. http:\/\/proceedings.mlr.press\/v51\/jamieson16.html"},{"key":"e_1_2_1_22_1","first-page":"3050","article-title":"A Deep Reinforcement Learning Perspective on Internet Congestion Control","volume":"97","author":"Jay N.","year":"2019","unstructured":"N. Jay , N. Rotman , B. Godfrey , M. Schapira , and A. Tamar . 2019 . A Deep Reinforcement Learning Perspective on Internet Congestion Control . In ICML , Vol. 97. 3050 -- 3059 . http:\/\/proceedings.mlr.press\/v97\/jay19a.html N. Jay, N. Rotman, B. Godfrey, M. Schapira, and A. Tamar. 2019. A Deep Reinforcement Learning Perspective on Internet Congestion Control. In ICML, Vol. 97. 3050--3059. http:\/\/proceedings.mlr.press\/v97\/jay19a.html","journal-title":"ICML"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2208917.2209336"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2895553"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935167"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0114-4"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9539-9"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.07.010"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34862-4_18"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2014.6734878"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2013.6465538"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117533"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462139"},{"key":"e_1_2_1_34_1","unstructured":"R. Mittal R. Agarwal S. Ratnasamy and S. Shenker. 2016. Universal Packet Scheduling. In NSDI. Santa Clara CA 501--521. https:\/\/www.usenix.org\/conference\/nsdi16\/technical-sessions\/presentation\/mittal  R. Mittal R. Agarwal S. Ratnasamy and S. Shenker. 2016. Universal Packet Scheduling. In NSDI. Santa Clara CA 501--521. https:\/\/www.usenix.org\/conference\/nsdi16\/technical-sessions\/presentation\/mittal"},{"key":"e_1_2_1_35_1","unstructured":"J. Reich C. Monsanto N. Foster J. Rexford and D. Walker. 2013. Modular SDN Programming with Pyretic. login Usenix Mag. 38 5 (2013). https:\/\/www.usenix.org\/publications\/login\/october-2013-volume-38-number-5\/modular-sdn-programming-pyretic  J. Reich C. Monsanto N. Foster J. Rexford and D. Walker. 2013. Modular SDN Programming with Pyretic. login Usenix Mag. 38 5 (2013). https:\/\/www.usenix.org\/publications\/login\/october-2013-volume-38-number-5\/modular-sdn-programming-pyretic"},{"key":"e_1_2_1_36_1","volume-title":"Eiffel: Efficient and Flexible Software Packet Scheduling. In NSDI.","author":"Saeed A.","year":"2019","unstructured":"A. Saeed , Y. Zhao , N. Dukkipati , E. Zegura , M. Ammar , K. Harras , and A. Vahdat . 2019 . Eiffel: Efficient and Flexible Software Packet Scheduling. In NSDI. Boston, MA , 17--32. https:\/\/www.usenix.org\/conference\/nsdi19\/presentation\/saeed A. Saeed, Y. Zhao, N. Dukkipati, E. Zegura, M. Ammar, K. Harras, and A. Vahdat. 2019. Eiffel: Efficient and Flexible Software Packet Scheduling. In NSDI. Boston, MA, 17--32. https:\/\/www.usenix.org\/conference\/nsdi19\/presentation\/saeed"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2834050.2834106"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934899"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491190"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674989"},{"key":"e_1_2_1_41_1","volume-title":"Loom: Flexible and Efficient NIC Packet Scheduling. In NSDI.","author":"Stephens B.","year":"2019","unstructured":"B. Stephens , A. Akella , and M. Swift . 2019 . Loom: Flexible and Efficient NIC Packet Scheduling. In NSDI. Boston, MA , 33--46. https:\/\/www.usenix.org\/conference\/nsdi19\/presentation\/stephens B. Stephens, A. Akella, and M. Swift. 2019. Loom: Flexible and Efficient NIC Packet Scheduling. In NSDI. Boston, MA, 33--46. https:\/\/www.usenix.org\/conference\/nsdi19\/presentation\/stephens"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/551283"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486030"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486020"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341617.3326148"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411740.3411745","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3411740.3411745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:39Z","timestamp":1750197759000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411740.3411745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,22]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7,22]]}},"alternative-id":["10.1145\/3411740.3411745"],"URL":"https:\/\/doi.org\/10.1145\/3411740.3411745","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2020,7,22]]},"assertion":[{"value":"2020-07-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}