{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:43:34Z","timestamp":1743151414582,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_34","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"459-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Analysis of Priority Queuing for Egress Traffic"],"prefix":"10.1007","author":[{"given":"Jun","family":"Kawahara","sequence":"first","affiliation":[]},{"given":"Koji M.","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Tomotaka","family":"Maeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"2","key":"34_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"},{"issue":"4","key":"34_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ipl.2012.12.014","volume":"113","author":"K Al-Bawani","year":"2013","unstructured":"Al-Bawani, K., Souza, A.: Buffer overflow management with class segregation. Inf. Process. Lett. 113(4), 145\u2013150 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s00453-008-9230-y","volume":"57","author":"S Albers","year":"2010","unstructured":"Albers, S., Jacobs, T.: An experimental study of new and known online packet buffering algorithms. Algorithmica 57(4), 725\u2013746 (2010)","journal-title":"Algorithmica"},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1137\/S0097539704446268","volume":"35","author":"S Albers","year":"2005","unstructured":"Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM J. Comput. 35(2), 278\u2013304 (2005)","journal-title":"SIAM J. Comput."},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Andelman, N.: Randomized queue management for DiffServ. In: Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures, pp. 1\u201310 (2005)","DOI":"10.1145\/1073970.1073972"},{"key":"34_CR6","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)"},{"key":"34_CR7","unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 761\u2013770 (2003)"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-005-1190-x","volume":"45","author":"Y Azar","year":"2006","unstructured":"Azar, Y., Litichevskey, A.: Maximizing throughput in multi-queue switches. Algorithmica 45(1), 69\u201390 (2006)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"34_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-005-1159-9","volume":"43","author":"Y Azar","year":"2005","unstructured":"Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. Algorithmica 43(1\u20132), 81\u201396 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1145\/1150334.1150342","volume":"2","author":"Y Azar","year":"2006","unstructured":"Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. ACM Trans. Algorithms 2(2), 282\u2013295 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"34_CR11","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, pp. 64\u201371 (2004)","DOI":"10.1145\/1007352.1007369"},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00453-003-1014-9","volume":"36","author":"A Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Freund, A., Landa, S., Naor, J.: Competitive on-line switching policies. Algorithmica 36(3), 225\u2013247 (2003)","journal-title":"Algorithmica"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-78773-0_22","volume-title":"LATIN 2008: Theoretical Informatics","author":"M Bienkowski","year":"2008","unstructured":"Bienkowski, M., M\u0105dry, A.: Geometric aspects of online packet buffering: an optimal randomized algorithm for two buffers. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 252\u2013263. Springer, Heidelberg (2008)"},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/s00453-012-9677-8","volume":"68","author":"M Bienkowski","year":"2014","unstructured":"Bienkowski, M.: An optimal lower bound for buffer management in multi-queue switches. Algorithmica 68(2), 426\u2013447 (2014)","journal-title":"Algorithmica"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Blanke, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services. RFC2475, IETF, December 1998","DOI":"10.17487\/rfc2475"},{"key":"34_CR16","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":"34_CR17","unstructured":"Cisco Systems Inc. Campus QoS Design (2014). http:\/\/www.cisco.com\/en\/US\/docs\/solutions\/Enterprise\/WAN_and_MAN\/QoS_SRND\/QoSDesign.html"},{"key":"34_CR18","unstructured":"Cisco Systems Inc. Cisco Catalyst 2955 series switches data sheets (2014). http:\/\/www.cisco.com\/en\/US\/products\/hw\/switches\/ps628\/products_data_sheets_list.html"},{"key":"34_CR19","unstructured":"Cisco Systems Inc. Cisco Catalyst 6500 series switches data sheets (2014). http:\/\/www.cisco.com\/en\/US\/products\/hw\/switches\/ps708\/products_data_sheets_list.html"},{"issue":"1","key":"34_CR20","first-page":"3","volume":"1","author":"A Demers","year":"1990","unstructured":"Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. J. Internetworking Res. Exper. 1(1), 3\u201326 (1990)","journal-title":"J. Internetworking Res. Exper."},{"issue":"4","key":"34_CR21","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"},{"issue":"1","key":"34_CR22","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. ACM SIGACT News 41(1), 100\u2013128 (2010)","journal-title":"ACM SIGACT News"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Hahne, E., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. In: Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures, pp. 53\u201358 (2001)","DOI":"10.1145\/378580.378589"},{"issue":"8","key":"34_CR24","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1109\/49.105173","volume":"9","author":"M Katevenis","year":"1991","unstructured":"Katevenis, M., Sidiropopulos, S., Courcoubetis, C.: Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE J. Sel. Area Commun. 9(8), 1265\u20131279 (1991)","journal-title":"IEEE J. Sel. Area Commun."},{"key":"34_CR25","unstructured":"Kawahara, J., Kobayashi, K.M., Maeda, T.: Tight analysis of priority queuing policy for egress traffic (2012). arXiv:1207.5959 [cs.DS]"},{"issue":"3","key":"34_CR26","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."},{"issue":"2\u20133","key":"34_CR27","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.tcs.2004.05.014","volume":"324","author":"A Kesselman","year":"2004","unstructured":"Kesselman, A., Mansour, Y.: Harmonic buffer management policy for shared memory switches. Theoret. Comput. Sci. 324(2\u20133), 161\u2013182 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"34_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00453-005-1158-x","volume":"43","author":"A Kesselman","year":"2005","unstructured":"Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. Algorithimica 43(1\u20132), 63\u201380 (2005)","journal-title":"Algorithimica"},{"issue":"1","key":"34_CR29","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jalgor.2004.09.003","volume":"60","author":"A Kesselman","year":"2006","unstructured":"Kesselman, A., Ros\u00e9n, A.: Scheduling policies for CIOQ switches. J. Algorithms 60(1), 60\u201383 (2006)","journal-title":"J. Algorithms"},{"issue":"1\/2","key":"34_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1142\/S0219265908002151","volume":"9","author":"A Kesselman","year":"2008","unstructured":"Kesselman, A., Ros\u00e9n, A.: Controlling CIOQ switches with priority queuing and in multistage interconnection networks. J. Interconnection Netw. 9(1\/2), 53\u201372 (2008)","journal-title":"J. Interconnection Netw."},{"issue":"3","key":"34_CR31","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00446-010-0114-4","volume":"23","author":"A Kesselman","year":"2010","unstructured":"Kesselman, A., Kogan, K., Segal, M.: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distrib. Comput. 23(3), 163\u2013175 (2010)","journal-title":"Distrib. Comput."},{"key":"34_CR32","unstructured":"Kesselman, A., Kogan, K., Segal, M.: Best effort and priority queuing policies for buffered crossbar switches. Chicago J. Theor. Sci. 1\u201314 (2012)"},{"issue":"1\u20132","key":"34_CR33","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00453-011-9539-9","volume":"63","author":"A Kesselman","year":"2012","unstructured":"Kesselman, A., Kogan, K., Segal, M.: Improved competitive performance bounds for CIOQ switches. Algorithmica 63(1\u20132), 411\u2013424 (2012)","journal-title":"Algorithmica"},{"key":"34_CR34","doi-asserted-by":"crossref","unstructured":"Kobayashi, K., Miyazaki, S., Okabe, Y.: A tight bound on online buffer management for two-port shared-memory switches. In: Proceedings of the 19th ACM Symposium on Parallel Algorithms and Architectures, pp. 358\u2013364 (2007)","DOI":"10.1145\/1248377.1248437"},{"issue":"12","key":"34_CR35","first-page":"2757","volume":"E91\u2013D","author":"K Kobayashi","year":"2008","unstructured":"Kobayashi, K., Miyazaki, S., Okabe, Y.: A tight upper bound on online buffer management for multi-queue switches with bicodal buffers. IEICE Trans. Fund. Electron. Commun. Comput. Sci. E91\u2013D(12), 2757\u20132769 (2008)","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"key":"34_CR36","doi-asserted-by":"crossref","unstructured":"Kobayashi, K., Miyazaki, S., Okabe, Y.: Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms. In: Proceedings of the 21st ACM Symposium on Parallel Algorithms and Architectures, pp. 328\u2013336 (2009)","DOI":"10.1145\/1583991.1584070"},{"key":"34_CR37","doi-asserted-by":"crossref","unstructured":"Kogan, K., Lopez-Ortiz, A., Nikolenko, S., Sirotkin, A.: Multi-queued network processors for packets with heterogeneous processing requirements. In: Proceedings of the 5th International Conference on Communication Systems and Networks, pp. 1\u201310 (2013)","DOI":"10.1109\/COMSNETS.2013.6465538"},{"issue":"2","key":"34_CR38","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-003-1064-z","volume":"38","author":"R Fleischer","year":"2004","unstructured":"Fleischer, R., Koga, H.: Balanced scheduling toward loss-free packet queuing and delay fairness. Algorithmica 38(2), 363\u2013376 (2004)","journal-title":"Algorithmica"},{"issue":"2","key":"34_CR39","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"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T14:27:02Z","timestamp":1675348022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}