{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T22:41:39Z","timestamp":1789512099893,"version":"build-2803163510"},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2004,1]]},"abstract":"<jats:p>We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the order in which they arrive; the constraint in this case is the limited buffer space. In the bounded-delay type, each packet has a maximum delay time by which it must be transmitted, or otherwise it is lost. We study the case of overloads resulting in packet loss. In our model, each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets.<\/jats:p>\n                  <jats:p>Our main contribution is a thorough investigation of some natural greedy algorithms in various models. For the FIFO model we prove tight bounds on the competitive ratio of the greedy algorithm that discards packets with the lowest value when an overflow occurs. We also prove that the greedy algorithm that drops the earliest packets among all low-value packets is the best greedy algorithm. This algorithm can be as much as 1.5 times better than the tail-drop greedy policy, which drops the latest lowest-value packets.<\/jats:p>\n                  <jats:p>In the bounded-delay model we show that the competitive ratio of any on-line algorithm for a uniform bounded-delay buffer is bounded away from 1, independent of the delay size. We analyze the greedy algorithm in the general case and in three special cases: delay bound 2, link bandwidth 1, and only two possible packet values.<\/jats:p>\n                  <jats:p>Finally, we consider the off-line scenario. We give efficient optimal algorithms and study the relation between the bounded-delay and FIFO models in this case.<\/jats:p>","DOI":"10.1137\/s0097539701399666","type":"journal-article","created":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T21:00:51Z","timestamp":1080853251000},"page":"563-583","source":"Crossref","is-referenced-by-count":123,"title":["Buffer Overflow Management in QoS Switches"],"prefix":"10.1137","volume":"33","author":[{"given":"Alexander","family":"Kesselman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2012,2,17]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"M. Adler, A. L. Rosenberg, R. K. Sitaraman, and W. Unger,\n                      Scheduling time\u2010constrained communication in linear networks\n                      , in Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, 1998, pp. 269\u2013278.","DOI":"10.1145\/277651.277693"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen,\n                      Competitive queue policies for differentiated services\n                      , in Proc. IEEE INFOCOM, 2000, pp. 431\u2013440.","DOI":"10.1109\/INFCOM.2000.832216"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799354138"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang,\n                      On the competitiveness of online real\u2010time task scheduling\n                      , in Proceedings of the 32nd IEEE Symposium on Real\u2010Time Systems, 1992, pp. 125\u2013144.","DOI":"10.1007\/BF00365406"},{"key":"R7","unstructured":"S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha,\n                      Online scheduling in the presence of overload\n                      , in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 101\u2013110."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"D. Black, S. Blake, M. Carlson, E. Davies, Z. Wang, and W. Weiss,\n                      An Architecture for Differentiated Services\n                      , Internet draft, RFC 2475, Internet Engineering Task Force, 1998.","DOI":"10.17487\/rfc2475"},{"key":"R9","unstructured":"D. Clark and J. Wroclawski,\n                      An Approach to Service Allocation in the Internet\n                      , unpublished, 1997."},{"key":"R10","volume-title":"Introduction to algorithms","author":"Cormen Thomas","year":"1990"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1060"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"V. Jacobson, K. Nicholas, and K. Poduri,\n                      An Expedited Forwarding PHB\n                      , Internet draft, RFC 2598, Internet Engineering Task Force, 1999.","DOI":"10.17487\/rfc2598"},{"key":"R14","unstructured":"Alexander Kesselman, Yishay Mansour, Loss\u2010bounded analysis for differentiated services, SIAM, Philadelphia, PA, 2001, 591\u20136001958452"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236882"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"M. A. Labrador and S. Banerjee,\n                      Packet dropping policies for ATM and IP networks\n                      , IEEE Communications Surveys, 2 (1999).","DOI":"10.1109\/COMST.1999.5340708"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"T. V. Lakshman, A. Neidhardt, and T. Ott,\n                      The drop from front strategy in TCP and in TCP over ATM\n                      , in Proc. IEEE INFOCOM, 1996, pp. 1242\u20131250.","DOI":"10.1109\/INFCOM.1996.493070"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1109\/90.282603"},{"key":"R19","unstructured":"Richard Lipton, Andrew Tomkins, Online interval scheduling, ACM, New York, 1994, 302\u201331195c:90059"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-003-0101-0"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"M. May, J.\u2010C. Bolot, A. Jean\u2010Marie, and C. Diot,\n                      Simple performance models of differentiated services for the Internet\n                      , in Proc. IEEE INFOCOM, 1999, pp. 1385\u20131394.","DOI":"10.1109\/INFCOM.1999.752158"},{"key":"R22","unstructured":"Cynthia Phillips, R. Uma, Joel Wein, Off\u2010line admission control for general scheduling problems, ACM, New York, 2000, 879\u20138881755549"},{"key":"R23","unstructured":"The ATM Forum Technical Committee,\n                      Traffic Management Specification Version 4.0\n                      , ftp:\/\/ftp.atmforum.com\/pub\/approved\u2010specs\/af\u2010tm\u20100056.000.pdf (April 1996)."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"A. Veres and M. Boda,\n                      The chaotic nature of TCP congestion control\n                      , in Proc. IEEE INFOCOM, 2000, pp. 1715\u20131723.","DOI":"10.1109\/INFCOM.2000.832571"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539701399666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:17:28Z","timestamp":1787336248000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539701399666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["10.1137\/S0097539701399666"],"URL":"https:\/\/doi.org\/10.1137\/s0097539701399666","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}