{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:21:15Z","timestamp":1648549275359},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,12,4]],"date-time":"2007-12-04T00:00:00Z","timestamp":1196726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00453-007-9053-2","type":"journal-article","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T23:51:09Z","timestamp":1196725869000},"page":"367-386","source":"Crossref","is-referenced-by-count":2,"title":["Competitive Analysis of Scheduling Algorithms for\u00a0Aggregated Links"],"prefix":"10.1007","volume":"51","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","published-online":{"date-parts":[[2007,12,4]]},"reference":[{"key":"9053_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":"9053_CR2","doi-asserted-by":"crossref","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 Trans. Netw. 7(6), 789\u2013798 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9053_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":"9053_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. 12(1,2), 61\u201386 (2003)","journal-title":"J. High Speed Netw."},{"issue":"2","key":"9053_CR5","doi-asserted-by":"crossref","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. 6(2), 167\u2013181 (2003)","journal-title":"J. Sched."},{"key":"9053_CR6","unstructured":"Gareiss, R.: Is the Internet in trouble? Data Communications Magazine, Sept. 1997"},{"key":"9053_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9053_CR8","doi-asserted-by":"crossref","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 Syst. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"9053_CR9","unstructured":"IEEE, C.S.: Part 3: carrier sense multiple access with collision detection (CSMA\/CD) access method and physical layer specifications. In IEEE Std 802.3. Standard for Information Technology Telecommunications and Information Exchange between Systems Local and Metropolitan Area Networks Specific Requirements. The Institute of Electrical and Electronics Engineers, Inc., 3\u00a0Park Avenue, New York, NY 10016-5997, USA, 2002"},{"issue":"1","key":"9053_CR10","doi-asserted-by":"crossref","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 36(1), 71\u201385 (2005)","journal-title":"SIGACT News"},{"key":"9053_CR11","doi-asserted-by":"crossref","unstructured":"Jawor, W., Chrobak, M., Molle, M.: Experimental analysis of scheduling algorithms for aggregated links (2006, in preparation)","DOI":"10.1007\/11682462_57"},{"key":"9053_CR12","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","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. CRC Press, New York (2004), Chapter\u00a015"},{"key":"9053_CR13","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. 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":"9053_CR14","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Probabilistic computations: towards a unified measure of complexity. In: Proc. 18th Symp. Foundations of Computer Science (FOCS), pp.\u00a0222\u2013227. IEEE (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9053-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9053-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9053-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:00Z","timestamp":1559137500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9053-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,4]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9053"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9053-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,4]]}}}