{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:35Z","timestamp":1750306295321,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T00:00:00Z","timestamp":1458172800000},"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":[],"published-print":{"date-parts":[[2016,3,17]]},"DOI":"10.1145\/2881025.2881027","type":"proceedings-article","created":{"date-parts":[[2016,3,14]],"date-time":"2016-03-14T15:33:45Z","timestamp":1457969625000},"page":"69-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["BASEL (Buffer mAnagement SpEcification Language)"],"prefix":"10.1145","author":[{"given":"Kirill","family":"Kogan","sequence":"first","affiliation":[{"name":"IMDEA Networks Institute, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danushka","family":"Menikkumbura","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Petri","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Diderot - Paris 7, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YoungTae","family":"Noh","sequence":"additional","affiliation":[{"name":"Inha University, Incheon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Nikolenko","sequence":"additional","affiliation":[{"name":"Steklov Math. Institute at St. Petersburg and National Research University Higher School of Economics, St. Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Eugster","sequence":"additional","affiliation":[{"name":"Purdue University and TU Darmstadt, West Lafayette, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,3,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"OMNeT++. http:\/\/www.omnetpp.org\/.  OMNeT++. http:\/\/www.omnetpp.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Open vSwitch. http:\/\/www.openvswitch.org.  Open vSwitch. http:\/\/www.openvswitch.org."},{"key":"e_1_3_2_1_3_1","unstructured":"This is the ns-2 wiki. http:\/\/nsnam.isi.edu\/nsnam\/index.php\/Main_Page.  This is the ns-2 wiki. http:\/\/nsnam.isi.edu\/nsnam\/index.php\/Main_Page."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1435375.1435378"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068833"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218519"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.55"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801399"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486003"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034812"},{"key":"e_1_3_2_1_16_1","unstructured":"J. Gettys. Low latency requires smart queuing:traditional AQM is not enough! 2013. http:\/\/www.internetsociety.org\/sites\/default\/files\/pdf\/accepted\/29_bis_ISOC_Workshop_2.pdf.  J. Gettys. Low latency requires smart queuing:traditional AQM is not enough! 2013. http:\/\/www.internetsociety.org\/sites\/default\/files\/pdf\/accepted\/29_bis_ISOC_Workshop_2.pdf."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753171.1753195"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.892882"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2186979"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0114-4"},{"key":"e_1_3_2_1_23_1","first-page":"2012","article-title":"Best effort and priority queuing policies for buffered crossbar switches","author":"Kesselman A.","year":"2012","unstructured":"A. Kesselman , K. Kogan , and M. Segal . Best effort and priority queuing policies for buffered crossbar switches . Chicago J. Theor. Comput. Sci. , 2012 , 2012 . A. Kesselman, K. Kogan, and M. Segal. Best effort and priority queuing policies for buffered crossbar switches. Chicago J. Theor. Comput. Sci., 2012, 2012.","journal-title":"Chicago J. Theor. Comput. Sci."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9539-9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380847"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.09.003"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2014.6734878"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2013.6465538"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34862-4_18"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2012.6407771"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1990.91316"},{"key":"e_1_3_2_1_32_1","volume-title":"OpenFlow switch specification","author":"McKeown N.","year":"2011","unstructured":"N. McKeown , G. Parulkar , S. Shenker , T. Anderson , L. Peterson , J. Turner , H. Balakrishnan , and J. Rexford . OpenFlow switch specification , 2011 . http:\/\/www.openflow.org\/documents\/openflow-spec-v1.1.0.pdf. N. McKeown, G. Parulkar, S. Shenker, T. Anderson, L. Peterson, J. Turner, H. Balakrishnan, and J. Rexford. OpenFlow switch specification, 2011. http:\/\/www.openflow.org\/documents\/openflow-spec-v1.1.0.pdf."},{"key":"e_1_3_2_1_33_1","first-page":"1","volume-title":"NSDI","author":"Monsanto C.","year":"2013","unstructured":"C. Monsanto , J. Reich , N. Foster , J. Rexford , and D. Walker . Composing software defined networks . In NSDI , pages 1 -- 13 , 2013 . C. Monsanto, J. Reich, N. Foster, J. Rexford, and D. Walker. Composing software defined networks. In NSDI, pages 1--13, 2013."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2007.4380693"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2209249.2209264"},{"key":"e_1_3_2_1_36_1","volume-title":"Encyclopedia of Algorithms","author":"Nikolenko S. I.","year":"2015","unstructured":"S. I. Nikolenko and K. Kogan . Single and multiple buffer processing . In Encyclopedia of Algorithms . Springer , 2015 . S. I. Nikolenko and K. Kogan. Single and multiple buffer processing. In Encyclopedia of Algorithms. Springer, 2015."},{"key":"e_1_3_2_1_37_1","first-page":"117","volume-title":"USENIX NSDI","author":"Pfaff B.","year":"2015","unstructured":"B. Pfaff , J. Pettit , T. Koponen , E. J. Jackson , A. Zhou , J. Rajahalme , J. Gross , A. Wang , J. Stringer , P. Shelar , K. Amidon , and M. Casado . The design and implementation of open vswitch . In USENIX NSDI , pages 117 -- 130 , 2015 . B. Pfaff, J. Pettit, T. Koponen, E. J. Jackson, A. Zhou, J. Rajahalme, J. Gross, A. Wang, J. Stringer, P. Shelar, K. Amidon, and M. Casado. The design and implementation of open vswitch. In USENIX NSDI, pages 117--130, 2015."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342396"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535796"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491190"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674989"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/231699.231701"}],"event":{"name":"ANCS '16: Symposium on Architectures for Networking and Communications Systems","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"],"location":"Santa Clara California USA","acronym":"ANCS '16"},"container-title":["Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2881025.2881027","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2881025.2881027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:11Z","timestamp":1750221551000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2881025.2881027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,17]]},"references-count":42,"alternative-id":["10.1145\/2881025.2881027","10.1145\/2881025"],"URL":"https:\/\/doi.org\/10.1145\/2881025.2881027","relation":{},"subject":[],"published":{"date-parts":[[2016,3,17]]},"assertion":[{"value":"2016-03-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}