{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:18Z","timestamp":1772164038280,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"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":[[2018,6,12]]},"DOI":"10.1145\/3219617.3219629","type":"proceedings-article","created":{"date-parts":[[2018,6,13]],"date-time":"2018-06-13T14:21:21Z","timestamp":1528899681000},"page":"28-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Randomized Online Algorithm for QoS Buffer Management"],"prefix":"10.1145","author":[{"given":"Lin","family":"Yang","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing Shing","family":"Wong","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad H.","family":"Hajiesmaili","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832216"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39989-6_12"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701399666"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"E. Mohr I. Ahmad and G. Schmidt. Online algorithms for conversion problems: a survey. Surveys in Operations Research and Management Science 19(2) 2014.  E. Mohr I. Ahmad and G. Schmidt. Online algorithms for conversion problems: a survey. Surveys in Operations Research and Management Science 19(2) 2014.","DOI":"10.1016\/j.sorms.2014.08.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078505.3078543"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154494"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3084460"}],"event":{"name":"SIGMETRICS '18: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","location":"Irvine CA USA","acronym":"SIGMETRICS '18","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219617.3219629","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219617.3219629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:39:17Z","timestamp":1750196357000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219617.3219629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":7,"alternative-id":["10.1145\/3219617.3219629","10.1145\/3219617"],"URL":"https:\/\/doi.org\/10.1145\/3219617.3219629","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3292040.3219629","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"2018-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}