{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:06:24Z","timestamp":1758272784420,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_24","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"293-304","source":"Crossref","is-referenced-by-count":14,"title":["Packet Buffering: Randomization Beats Deterministic Algorithms"],"prefix":"10.1007","author":[{"given":"Markus","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Mansour, Y., Rajagopolan, S., Ros\u00e9n, A.: Competitive queue policies for differentiated services. In: Proc. INFOCOM, pp. 431\u2013440 (2000)","DOI":"10.1109\/INFCOM.2000.832216"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symposium on Theory of Computing, pp. 35\u201344 (2004)","DOI":"10.1145\/1007352.1007366"},{"key":"24_CR3","unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies in QoS switches. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 761\u2013770 (2003)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: Management of multi-queue switches in QoS Networks. In: Proc. 35th ACM Symposium on Theory of Computing, pp. 82\u201389 (2003)","DOI":"10.1145\/780555.780556"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 36th ACM Symposium on Theory of Computing, pp. 64\u201371 (2004)","DOI":"10.1145\/1007352.1007369"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Aziz, A., Prakash, A., Ramachandran, V.: A new optimal scheduler for switch-memory-switch routers. In: Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 343\u2013352 (2003)","DOI":"10.1145\/777470.777472"},{"key":"24_CR7","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.: 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.\u00a03142, pp. 196\u2013207. Springer, Heidelberg (2004)"},{"key":"24_CR8","unstructured":"Bar-Noy, A., Freund, A., Landa, S., Naor, J.: Competitive on-line switching policies. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 525\u2013534 (2002)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. In: Proc. 13th ACM Symposium on Parallel Algorithms and Architectures, pp. 53\u201358 (2001)","DOI":"10.1145\/378580.378589"},{"key":"24_CR10","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. 31st ACM Symposium on Theory of Computing, pp. 520\u2013529 (2001)","DOI":"10.1145\/380752.380847"},{"key":"24_CR11","unstructured":"Kesselman, A., Mansour, Y.: Loss-bounded analysis for differentiated services. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 591\u2013600 (2001)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-39658-1_34","volume-title":"Algorithms - ESA 2003","author":"A. Kesselman","year":"2003","unstructured":"Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 361\u2013372. Springer, Heidelberg (2003)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Ros\u00e9n, A.: Scheduling policies for CIOQ switches. In: Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 353\u2013361 (2003)","DOI":"10.1145\/777412.777473"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45678-3_6","volume-title":"Algorithms and Computation","author":"H. Koga","year":"2001","unstructured":"Koga, H.: Balanced scheduling towards loss-free packet queueing and delay fairness. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 61\u201373. Springer, Heidelberg (2001)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:09:51Z","timestamp":1739920191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}