{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:16:32Z","timestamp":1761401792084,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T00:00:00Z","timestamp":1458172800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1366\/07"],"award-info":[{"award-number":["1366\/07"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10951-016-0474-0","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T13:26:57Z","timestamp":1458307617000},"page":"337-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Non-preemptive buffer management for latency sensitive packets"],"prefix":"10.1007","volume":"20","author":[{"given":"Moran","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph\u00a0(Seffi)","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,17]]},"reference":[{"key":"474_CR1","unstructured":"Andelman, N., Mansour, Y., & Zhu, A. (2003). Competitive queueing policies for QoS switches. In SODA (pp. 761\u2013770)."},{"issue":"1\u20132","key":"474_CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00453-005-1159-9","volume":"43","author":"Y Azar","year":"2005","unstructured":"Azar, Y., & Richter, Y. (2005). Management of multi-queue switches in QoS networks. Algorithmica, 43(1\u20132), 81\u201396.","journal-title":"Algorithmica"},{"key":"474_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Chin, F. Y. L., Chrobak, M., Fung, S. P. Y., Jawor, W., Lavi, R., Sgall, J., & Tichy, T. (2004). Online competitive algorithms for maximizing weighted throughput of unit jobs. In STACS (pp. 187\u2013198).","DOI":"10.1007\/978-3-540-24749-4_17"},{"issue":"3","key":"474_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"FYL Chin","year":"2003","unstructured":"Chin, F. Y. L., & Fung, S. P. Y. (2003). Online scheduling with partial job values: Does timesharing or randomization help? Algorithmica, 37(3), 149\u2013164.","journal-title":"Algorithmica"},{"issue":"4","key":"474_CR5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1290672.1290687","volume":"3","author":"M Chrobak","year":"2007","unstructured":"Chrobak, M., Jawor, W., Sgall, J., & Tich\u00fd, T. (2007). Improved online algorithms for buffer management in QoS switches. ACM Transactions Algorithms, 3(4), 50.","journal-title":"ACM Transactions Algorithms"},{"issue":"4","key":"474_CR6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00453-008-9236-5","volume":"53","author":"M Englert","year":"2009","unstructured":"Englert, M., & Westermann, M. (2009). Lower and upper bounds on fifo buffer management in QoS switches. Algorithmica, 53(4), 523\u2013548.","journal-title":"Algorithmica"},{"issue":"5","key":"474_CR7","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1137\/110856745","volume":"41","author":"M Englert","year":"2012","unstructured":"Englert, M., & Westermann, M. (2012). Considering suppressed packets improves buffer management in quality of service switches. SIAM Journal on Computing, 41(5), 1166\u20131192.","journal-title":"SIAM Journal on Computing"},{"key":"474_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, M., & Naor, J. S. (2010). Non-preemptive buffer management for latency sensitive packets. In INFOCOM (pp. 186\u2013190).","DOI":"10.1109\/INFCOM.2010.5462248"},{"key":"474_CR9","unstructured":"Fiat, A., Mansour, Y., & Nadav, U. (2007). Competitive queue management for latency sensitive packets. In PEGG."},{"key":"474_CR10","unstructured":"Fiat, A., Mansour, Y., & Nadav, U. (2008). Competitive queue management for latency sensitive packets. In SODA (pp. 228\u2013237)."},{"key":"474_CR11","unstructured":"Garg, N., Gupta, A., Leonardi, S., & Sankowski, P. (2008). Stochastic analyses for online combinatorial optimization problems. In SODA (pp. 942\u2013951)."},{"issue":"4","key":"474_CR12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/s00453-012-9700-0","volume":"67","author":"L Je\u017c","year":"2013","unstructured":"Je\u017c, L. (2013). A universal randomized packet scheduling algorithm. Algorithmica, 67(4), 498\u2013515.","journal-title":"Algorithmica"},{"issue":"1","key":"474_CR13","first-page":"5:1","volume":"9","author":"L Je\u017c","year":"2012","unstructured":"Je\u017c, L., Li, F., Sethuraman, J., & Stein, C. (2012). Online scheduling of packets with agreeable deadlines. ACM Transactions Algorithms, 9(1), 5:1\u20135:11.","journal-title":"ACM Transactions Algorithms"},{"issue":"1","key":"474_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/90.282603","volume":"2","author":"WE Leland","year":"1994","unstructured":"Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994). On the self-similar nature of ethernet traffic (extended version). IEEE\/ACM Transactions on Networking, 2(1), 1\u201315.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"474_CR15","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/90.392383","volume":"3","author":"V Paxson","year":"1995","unstructured":"Paxson, V., & Floyd, S. (1995). Wide-area traffic: The failure of poisson modeling. IEEE\/ACM Transactions on Networking, 3, 226\u2013244.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"474_CR16","doi-asserted-by":"crossref","unstructured":"Veres, A., & Boda, M. (2000). The chaotic nature of tcp congestion control. In INFOCOMM (pp. 1715\u20131723).","DOI":"10.1109\/INFCOM.2000.832571"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0474-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0474-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0474-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0474-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:52Z","timestamp":1559453992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0474-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,17]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0474-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2016,3,17]]}}}