{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:26Z","timestamp":1725544766187},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_57","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"617-628","source":"Crossref","is-referenced-by-count":1,"title":["Competitive Analysis of Scheduling Algorithms for Aggregated Links"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Jawor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","unstructured":"Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proc. 9th Symp. on Discrete Algorithms (SODA), pp. 270\u2013279. ACM\/SIAM (1998)"},{"issue":"6","key":"57_CR2","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/90.811445","volume":"7","author":"J.C.R. Bennett","year":"1999","unstructured":"Bennett, J.C.R., Partridge, C., Shectman, N.: Packet reordering is not pathological network behavior. IEEE\/ACM Transactions on networking\u00a07(6), 789\u2013798 (1999)","journal-title":"IEEE\/ACM Transactions on networking"},{"key":"57_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)"},{"issue":"1,2","key":"57_CR4","first-page":"61","volume":"12","author":"J.A. Cobb","year":"2003","unstructured":"Cobb, J.A., Lin, M.: A theory of multi-channel schedulers for quality of service. J. High Speed Netw.\u00a012(1,2), 61\u201386 (2003)","journal-title":"J. High Speed Netw."},{"issue":"2","key":"57_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1022987804726","volume":"6","author":"E. Feuerstein","year":"2003","unstructured":"Feuerstein, E., Mydlarz, M., Stougie, L.: On-line multi-threaded scheduling. J. Sched.\u00a06(2), 167\u2013181 (2003)","journal-title":"J. Sched."},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical J.\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical J."},{"issue":"1","key":"57_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1052796.1052808","volume":"36","author":"W. Jawor","year":"2005","unstructured":"Jawor, W.: Three dozen papers on online algorithms. SIGACT News\u00a036(1), 71\u201385 (2005)","journal-title":"SIGACT News"},{"key":"57_CR8","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 15","author":"K. Pruhs","year":"2004","unstructured":"Pruhs, K., Torng, E., Sgall, J.: Online scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 15. CRC Press, Boca Raton (2004)"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines online. In: McGeoch, L.A., Sleator, D.D. (eds.) On-line Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a07, pp. 163\u2013166. AMS\/ACM (1992)","DOI":"10.1090\/dimacs\/007\/13"},{"key":"57_CR10","first-page":"222","volume-title":"Proc. 18th Symp. Foundations of Computer Science (FOCS)","author":"A.C.C. Yao","year":"1977","unstructured":"Yao, A.C.C.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. 18th Symp. Foundations of Computer Science (FOCS), pp. 222\u2013227. IEEE, Los Alamitos (1977)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:36Z","timestamp":1555445916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11682462_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}