乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:44Z","timestamp":1725856964468},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_19","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T11:33:54Z","timestamp":1464694434000},"page":"278-293","source":"Crossref","is-referenced-by-count":1,"title":["An Empirical Study of Online Packet Scheduling Algorithms"],"prefix":"10.1007","author":[{"given":"Nourhan","family":"Sakr","sequence":"first","affiliation":[]},{"given":"Cliff","family":"Stein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"crossref","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. (SICOMP) 35(2), 278\u2013304 (2005)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"19_CR2","unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queuing polices for QoS switches. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 761\u2013770 (2003)"},{"key":"19_CR3","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":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-93980-1_8","volume-title":"Approximation and Online Algorithms","author":"M Bienkowski","year":"2009","unstructured":"Bienkowski, M., Chrobak, M., Je\u017c, \u0141.: Randomized algorithms for buffer management with 2-bounded delay. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 92\u2013104. Springer, Heidelberg (2009)"},{"issue":"3","key":"19_CR5","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.: Online scheduling with partial job values: does timesharing or randomization help? Algorithmica 37(3), 149\u2013164 (2003)","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.tcs.2004.02.046","volume":"325","author":"FYL Chin","year":"2004","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Improved competitive algorithms for online scheduling with partial job values. Theor. Comput. Sci. 325(3), 467\u2013478 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.jda.2005.03.005","volume":"4","author":"FYL Chin","year":"2006","unstructured":"Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichy, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4(2), 255\u2013276 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/978-3-540-30140-0_20","volume-title":"Algorithms \u2013 ESA 2004","author":"M Chrobak","year":"2004","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Improved online algorithms for buffer management in QoS switches. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 204\u2013215. Springer, Heidelberg (2004)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/11841036_33","volume-title":"Algorithms \u2013 ESA 2006","author":"M Englert","year":"2006","unstructured":"Englert, M., Westermann, M.: Lower and upper bounds on FIFO buffer management in QoS switches. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 352\u2013363. Springer, Heidelberg (2006)"},{"key":"19_CR10","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 209\u2013218 (2007)"},{"key":"19_CR11","unstructured":"Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Proceedings of the 2001 Conference on Information Sciences and Systems (CISS), pp. 434\u2013438 (2001)"},{"issue":"1","key":"19_CR12","first-page":"5","volume":"9","author":"\u0141 Je\u017c","year":"2012","unstructured":"Je\u017c, \u0141., Li, F., Sethuraman, J., Stein, C.: Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms (TALG) 9(1), 5 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"3","key":"19_CR13","doi-asserted-by":"crossref","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. (SICOMP) 33(3), 563\u2013583 (2004)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"19_CR14","doi-asserted-by":"crossref","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. Algorithmica 43, 63\u201380 (2005)","journal-title":"Algorithmica"},{"key":"19_CR15","unstructured":"Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 199\u2013208 (2007)"},{"key":"19_CR16","unstructured":"Sakr, N., Stein, C.: An empirical study of online packet scheduling algorithms. Draft on arXiv under Computer Science: Data Structures and Algorithms. http:\/\/arxiv.org\/abs\/1603.07947"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T11:24:58Z","timestamp":1498303498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}