{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:01Z","timestamp":1725559141995},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_54","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"618-628","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Buffer Management via Resource Augmentation"],"prefix":"10.1007","author":[{"given":"Jae-Hoon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosen, A.: Competitive queue policies for differentiated services. In: Proc. of the IEEE INFOCOM, pp. 431\u2013440 (2000)","DOI":"10.1109\/INFCOM.2000.832216"},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. of 36th ACM Symposium on Theory of Computing (2004)(to appear)","DOI":"10.1145\/1007352.1007366"},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. In: Proc. of 35th ACM Symposium on Theory of Computing, pp. 82\u201389 (2003)","DOI":"10.1145\/780542.780556"},{"key":"54_CR4","unstructured":"Bar-Noy, A., Freund, A., Landa, S., Naor, J.: Competitive on-line switching policies. In: Proc. of 13th ACM Symposium on Discrete Algorithms, pp. 525\u2013534 (2002)"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"Brehob, M., Torng, E., Uthaisombut, P.: Applying extra-resource analysis to load balancing. In: Proc. of 11th ACM Symposium on Discrete Algorithms, pp. 560\u2013561 (2000)","DOI":"10.1002\/1099-1425(200009\/10)3:5<273::AID-JOS48>3.0.CO;2-0"},{"key":"54_CR6","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\u00a038, 363\u2013376 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"54_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: Speed is as powerful as clairvoyance. J. of ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"J. of ACM"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. of 31th ACM Symposium on Theory of Computing, pp. 520\u2013529 (2001)","DOI":"10.1145\/380752.380847"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. In: Proc. of 11th European Symposium on Algorithms, pp. 361\u2013372 (2003)","DOI":"10.1007\/978-3-540-39658-1_34"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"Koo, C.Y., Lam, T.W., Ngan, J., To, K.K.: Extra processors versus future information in optimal deadline scheduling. In: Proc. of 14th ACM Symposium on Parallel Algorithms and Architectures, pp. 133\u2013142 (2002)","DOI":"10.1145\/564870.564890"},{"key":"54_CR11","unstructured":"Lam, T.W., To, K.K.: Performance guarantee for online deadline scheduling in the presence of overload. In: Proc. of 12th ACM Symposium on Discrete Algorithms, pp. 755\u2013764 (2001)"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Patt-Shamir, B.: Nearly optimal FIFO buffer management for DiffServ. In: Proc. of 21th ACM Symposium on Principles of Distributed Computing, pp. 134\u2013142 (2002)","DOI":"10.1145\/571825.571851"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proc. of 29th ACM Symposium on Theory of Computing, pp. 140\u2013149 (1997)","DOI":"10.1145\/258533.258570"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Zhu, A.: Analysis of queueing policies in QoS switches. J. of Algorithms (to appear)","DOI":"10.1016\/j.jalgor.2004.04.007"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:29Z","timestamp":1605759689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}