{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:10:05Z","timestamp":1748815805906,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_3","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"27-40","source":"Crossref","is-referenced-by-count":1,"title":["Comparison-Based FIFO Buffer Management in QoS Switches"],"prefix":"10.1007","author":[{"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":[[2016,3,22]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jalgor.2004.04.004","volume":"55","author":"W Aiello","year":"2005","unstructured":"Aiello, W., 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":"3_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-39989-6_12","volume-title":"Distributed Computing","author":"N Andelman","year":"2003","unstructured":"Andelman, N., Mansour, Y.: Competitive management of non-preemptive queues with multiple values. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 166\u2013180. Springer, Heidelberg (2003)"},{"unstructured":"Andelma, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 761\u2013770 (2003)","key":"3_CR3"},{"doi-asserted-by":"crossref","unstructured":"Andelman, N.: Randomized queue management for DiffServ. In: Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 1\u201310 (2005)","key":"3_CR4","DOI":"10.1145\/1073970.1073972"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-662-47672-7_8","volume-title":"Automata, Languages and Programming (ICALP)","author":"Y Azar","year":"2015","unstructured":"Azar, Y., Cohen, I.R.: Serving in the dark should be done non-uniformly. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 91\u2013102. Springer, Heidelberg (2015)"},{"doi-asserted-by":"crossref","unstructured":"Azar,Y., Cohen, IR., Gamzu, I.: The loss of serving in the dark. In: Proceedings of the 45th ACM Symposium on Theory of Computing (STOC), pp. 951\u2013960 (2013)","key":"3_CR6","DOI":"10.1145\/2488608.2488729"},{"doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 64\u201371 (2004)","key":"3_CR7","DOI":"10.1145\/1007352.1007369"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-27836-8_19","volume-title":"Automata, Languages and Programming","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Fleischer, L.K., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.I.: Further improvements in competitive guarantees for QoS buffering. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 196\u2013207. Springer, Heidelberg (2004)"},{"unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 209\u2013218 (2007)","key":"3_CR9"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","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"},{"key":"3_CR11","doi-asserted-by":"publisher","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\u20132","key":"3_CR12","doi-asserted-by":"publisher","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":"3_CR13","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 J. Comput. 33(3), 563\u2013583 (2004)","journal-title":"SIAM J. Comput."},{"unstructured":"Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 199\u2013208 (2007)","key":"3_CR14"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","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. Networking 3(3), 226\u2013244 (1995)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","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"},{"doi-asserted-by":"crossref","unstructured":"Veres, A., Boda, M.: The chaotic nature of TCP congestion control. In: Proceedings of IEEE INFOCOM, pp. 1715\u20131723 (2000)","key":"3_CR17","DOI":"10.1109\/INFCOM.2000.832571"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:29:16Z","timestamp":1748813356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}