{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:24Z","timestamp":1725603684038},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_21","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"239-250","source":"Crossref","is-referenced-by-count":2,"title":["One to Rule Them All: A\u00a0General Randomized Algorithm for Buffer Management with Bounded Delay"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Je\u017c","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for qos switches. In: Proc. of the 14th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 761\u2013770 (2003)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-31833-0_1","volume-title":"Approximation and Online Algorithms","author":"Y. Azar","year":"2005","unstructured":"Azar, Y.: Online packet switching. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 1\u20135. Springer, Heidelberg (2005)"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. Algorithmica\u00a011(1), 2\u201314 (1994); also appeared in Proc.\u00a0of the 22nd STOC, pp. 379\u2013386 (1990)","journal-title":"Algorithmica"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Chrobak, M., D\u00fcrr, C., Hurand, M., Je\u017c, A., Je\u017c, \u0141., Stachowiak, G.: Collecting weighted items from a dynamic queue. In: Proc.\u00a0of the 20th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1126\u20131135 (2009)","DOI":"10.1137\/1.9781611973068.122"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-93980-1_8","volume-title":"Approximation and Online Algorithms","author":"M. Bienkowski","year":"2009","unstructured":"Bienkowski, M., Chrobak, M., Je\u017c, \u0141.: Randomized algorithms for buffer management with 2-bounded delay. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 92\u2013104. Springer, Heidelberg (2009)"},{"key":"21_CR6","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jda.2005.03.005","volume":"4","author":"F.Y.L. Chin","year":"2006","unstructured":"Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tich\u00fd, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. Journal of Discrete Algorithms\u00a04, 255\u2013276 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"F.Y.L. Chin","year":"2003","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling for partial job values: Does timesharing or randomization help? Algorithmica\u00a037, 149\u2013164 (2003)","journal-title":"Algorithmica"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Improved online algorithms for buffer management in QoS switches. ACM Transactions on Algorithms\u00a03(4) (2007); also appeared in Proc.\u00a0of the 12th ESA, pp. 204\u2013215 (2004)","DOI":"10.1145\/1290672.1290687"},{"key":"21_CR10","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proc. of the 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 209\u2013218 (2007)"},{"key":"21_CR11","first-page":"58","volume":"35","author":"L. Epstein","year":"2004","unstructured":"Epstein, L., van Stee, R.: Buffer management problems. Sigact News\u00a035, 58\u201366 (2004)","journal-title":"Sigact News"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"41","author":"M. Goldwasser","year":"2010","unstructured":"Goldwasser, M.: A survey of buffer management policies for packet switches. SIGACT News\u00a041(1), 100\u2013128 (2010)","journal-title":"SIGACT News"},{"key":"21_CR13","unstructured":"Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Conference in Information Sciences and Systems, pp. 434\u2013438 (2001)"},{"key":"21_CR14","unstructured":"Je\u017c, \u0141.: Randomised buffer management with bounded delay against adaptive adversary. CoRR abs\/0907.2050 (2009)"},{"key":"21_CR15","unstructured":"Je\u017c, \u0141.: Randomized algorithm for agreeable deadlines packet scheduling. In: Proc. of the 27th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 489\u2013500 (2010)"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/S0097539701399666","volume":"33","author":"A. Kesselman","year":"2004","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. SIAM Journal on Computing\u00a033(3), 563\u2013583 (2004); also appeared in Proc.of the 33rd STOC, pp 520\u2013529, (2001)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR17","unstructured":"Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proc. of the 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 801\u2013802 (2005)"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jalgor.2004.04.007","volume":"53","author":"A. Zhu","year":"2004","unstructured":"Zhu, A.: Analysis of queueing policies in QoS switches. Journal of Algorithms\u00a053(2), 137\u2013168 (2004)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T11:15:06Z","timestamp":1554117306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}