{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:59Z","timestamp":1740109259167,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T00:00:00Z","timestamp":1509753600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["307696","307696"],"award-info":[{"award-number":["307696","307696"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00453-017-0393-2","type":"journal-article","created":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T09:20:41Z","timestamp":1509787241000},"page":"1073-1092","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparison-Based Buffer Management in QoS Switches"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9381-5414","authenticated-orcid":false,"given":"Kamal","family":"Al-Bawani","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Englert","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Westermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,4]]},"reference":[{"issue":"2","key":"393_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.jalgor.2004.04.004","volume":"55","author":"WA Aiello","year":"2005","unstructured":"Aiello, W.A., Mansour, Y., Rajagopolan, S., Ros\u00e9n, A.: Competitive queue policies for differentiated services. J. Algorithms 55(2), 113\u2013141 (2005)","journal-title":"J. Algorithms"},{"key":"393_CR2","doi-asserted-by":"crossref","unstructured":"Andelman, N., Mansour, Y.: Competitive management of non-preemptive queues with multiple values. In: Proceedings\u00a0of the 17th International\u00a0Conference\u00a0on Distributed Computing (DISC), pp. 166\u2013180 (2003)","DOI":"10.1007\/978-3-540-39989-6_12"},{"key":"393_CR3","unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proceedings\u00a0of the 14th Annual ACM-SIAM Symposium\u00a0on Discrete Algorithms (SODA), pp. 761\u2013770 (2003)"},{"key":"393_CR4","doi-asserted-by":"crossref","unstructured":"Andelman, N.: Randomized queue management for DiffServ. In: Proceedings\u00a0of the 17th ACM Symposium\u00a0on Parallelism in Algorithms and Architectures (SPAA), pp. 1\u201310 (2005)","DOI":"10.1145\/1073970.1073972"},{"key":"393_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Cohen, I.R.: Serving in the dark should be done non-uniformly. In: Proceedings\u00a0of the 42nd International\u00a0Colloquium on Automata, Languages and Programming (ICALP), pp. 91\u2013102 (2015)","DOI":"10.1007\/978-3-662-47672-7_8"},{"key":"393_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Cohen, I.R., Gamzu, I.: The loss of serving in the dark. In: Proceedings\u00a0of the 45th ACM Symposium\u00a0on Theory of Computing (STOC), pp. 951\u2013960 (2013)","DOI":"10.1145\/2488608.2488729"},{"key":"393_CR7","doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proceedings\u00a0of the 36th ACM Symposium\u00a0on Theory of Computing (STOC), pp. 64\u201371 (2004)","DOI":"10.1145\/1007352.1007369"},{"key":"393_CR8","doi-asserted-by":"crossref","unstructured":"Bansal, N., Fleischer, L., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.: Further improvements in competitive guarantees for QoS buffering. In: Proceedings\u00a0of the 31st International\u00a0Colloquium on Automata, Languages and Programming (ICALP), pp. 196\u2013207 (2004)","DOI":"10.1007\/978-3-540-27836-8_19"},{"key":"393_CR9","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Chrobak, M., Je\u017c, \u0141.: Randomized algorithms for buffer management with 2-bounded delay. In: Proceedings\u00a0of the 6th Workshop on Approximation and Online Algorithms (WAOA), pp. 92\u2013104 (2008)","DOI":"10.1007\/978-3-540-93980-1_8"},{"issue":"39","key":"393_CR10","doi-asserted-by":"crossref","first-page":"5121","DOI":"10.1016\/j.tcs.2011.05.015","volume":"412","author":"M Bienkowski","year":"2011","unstructured":"Bienkowski, M., Chrobak, M., Je\u017c, \u0141.: Randomized competitive algorithms for online buffer management in the adaptive adversary model. Theor. Comput. Sci. 412(39), 5121\u20135131 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"393_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.jda.2005.03.005","volume":"4","author":"FYL 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. J. Discret. Algorithms 4(2), 255\u2013276 (2006)","journal-title":"J. Discret. Algorithms"},{"key":"393_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"FYL Chin","year":"2003","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling for partial job values: does timesharing or randomization help? Algorithmica 37, 149\u2013164 (2003)","journal-title":"Algorithmica"},{"issue":"4","key":"393_CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1290672.1290687","volume":"3","author":"M Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Improved online algorithms for buffer management in QoS switches. ACM Trans. Algorithms 3(4), 50 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"393_CR14","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"4","key":"393_CR15","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00453-008-9236-5","volume":"53","author":"M Englert","year":"2009","unstructured":"Englert, M., Westermann, M.: Lower and upper bounds on FIFO buffer management in QoS switches. Algorithmica 53(4), 523\u2013548 (2009)","journal-title":"Algorithmica"},{"issue":"5","key":"393_CR16","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1137\/110856745","volume":"41","author":"M Englert","year":"2012","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in quality of service switches. SIAM J. Comput. 41(5), 1166\u20131192 (2012)","journal-title":"SIAM J. Comput."},{"key":"393_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"41","author":"MH Goldwasser","year":"2010","unstructured":"Goldwasser, M.H.: A survey of buffer management policies for packet switches. SIGACT News 41, 100\u2013128 (2010)","journal-title":"SIGACT News"},{"issue":"1","key":"393_CR18","first-page":"5","volume":"9","author":"\u0141 Je\u017c","year":"2012","unstructured":"Je\u017c, \u0141., Li, F., Sethuraman, J., Stein, C.: Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms 9(1), 5 (2012)","journal-title":"ACM Trans. Algorithms"},{"issue":"1\u20132","key":"393_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00453-005-1160-3","volume":"43","author":"A Kesselman","year":"2005","unstructured":"Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. Algorithmica 43(1\u20132), 97\u2013111 (2005)","journal-title":"Algorithmica"},{"issue":"3","key":"393_CR20","doi-asserted-by":"crossref","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 J. Comput. 33(3), 563\u2013583 (2004)","journal-title":"SIAM J. Comput."},{"key":"393_CR21","unstructured":"Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proceedings\u00a0of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 801\u2013802 (2005)"},{"key":"393_CR22","unstructured":"Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings\u00a0of the 18th Annual ACM-SIAM Symposium\u00a0on Discrete Algorithms (SODA), pp. 199\u2013208 (2007)"},{"issue":"3","key":"393_CR23","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/90.392383","volume":"3","author":"V Paxson","year":"1995","unstructured":"Paxson, V., Floyd, S.: Wide-area traffic: the failure of Poisson modeling. IEEE\/ACM Trans. Netw. 3(3), 226\u2013244 (1995)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"393_CR24","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01294261","volume":"11","author":"N Reingold","year":"1994","unstructured":"Reingold, N., Westbrook, J., Sleator, D.D.: Randomized competitive algorithms for the list update problem. Algorithmica 11(1), 15\u201332 (1994)","journal-title":"Algorithmica"},{"issue":"2","key":"393_CR25","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"393_CR26","doi-asserted-by":"crossref","unstructured":"Veres, A., Boda, M.: The chaotic nature of TCP congestion control. In: Proceedings\u00a0of the 19th Annual IEEE International Conference on Computer Communications (INFOCOM), pp. 1715\u20131723 (2000)","DOI":"10.1109\/INFCOM.2000.832571"},{"issue":"2","key":"393_CR27","doi-asserted-by":"crossref","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. J Algorithms 53(2), 137\u2013168 (2004)","journal-title":"J Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0393-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0393-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0393-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T12:06:11Z","timestamp":1570277171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0393-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,4]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["393"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0393-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,11,4]]}}}