{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:30Z","timestamp":1725493530266},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_63","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"773-784","source":"Crossref","is-referenced-by-count":3,"title":["Online Packet Routing on Linear Arrays and Rings"],"prefix":"10.1007","author":[{"given":"Jessen T.","family":"Havill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"M. Adler, A. L. Rosenberg, R. K. Sitaraman, and W. Unger. Scheduling time-constrained communication in linear networks. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 269\u2013278, 1998.","DOI":"10.1145\/277651.277693"},{"key":"63_CR2","doi-asserted-by":"crossref","unstructured":"A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queuing theory. In Proc. ACM Symp. on Theory of Computing, pages 376\u2013385, 1996.","DOI":"10.1145\/237814.237984"},{"issue":"1","key":"63_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/S0097539791217695","volume":"24","author":"I. Cidon","year":"1995","unstructured":"I. Cidon, S. Kutten, Y. Mansour, and D. Peleg. Greedy packet scheduling. SIAM Journal on Computing, 24(1):148\u2013157, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"M. Kaufmann and J. F. Sibeyn. Deterministic routing on circular arrays. In Proc. IEEE Symp. on Parallel and Distributed Processing, pages 376\u2013383, 1992.","DOI":"10.1109\/SPDP.1992.242721"},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF02523190","volume":"17","author":"M. Kaufmann","year":"1997","unstructured":"M. Kaufmann and J. F. Sibeyn. Randomized multipacket routing an sorting on meshes. Algorithmica, 17:224\u2013244, 1997.","journal-title":"Algorithmica"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"K.-S. Lui and S. Zaks. Scheduling in synchronous networks and the greedy algorithm. In Proc. Int. Workshop on Distributed Algorithms, pages 66\u201380, 1997.","DOI":"10.1007\/BFb0030676"},{"issue":"1","key":"63_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jpdc.1994.1068","volume":"22","author":"F. Makedon","year":"1994","unstructured":"F. Makedon and A. Symvonis. Optimal algorithms for multipacket routing problems on rings. Journal of Parallel and Distributed Computing, 22(1):37\u201343, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"3","key":"63_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1993.1024","volume":"14","author":"Y. Mansour","year":"1993","unstructured":"Y. Mansour and B. Patt-Shamir. Greedy packet scheduling on shortest paths. Journal of Algorithms, 14(3):449\u2013465, 1993.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"63_CR9","first-page":"559","volume":"1","author":"W. Mao","year":"1994","unstructured":"W. Mao and R. Simha. Routing and scheduling file transfers in packet-switched networks. Journal of Computing and Information, 1(1):559\u2013574, 1994.","journal-title":"Journal of Computing and Information"},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"P. I. Rivera-Vega, R. Varadarajan, and S. B. Navathe. Scheduling data redistribution in distributed databases. In Proc. IEEE Int. Conf. on Data Engineering, pages 166\u2013173, 1990.","DOI":"10.1109\/ICDE.1990.113466"},{"key":"63_CR11","doi-asserted-by":"crossref","unstructured":"J. F. Sibeyn. Deterministic routing and sorting on rings. In Proc. IEEE Int. Parallel Processing Symp., pages 406\u2013410, 1994.","DOI":"10.1109\/IPPS.1994.288270"},{"key":"63_CR12","doi-asserted-by":"crossref","unstructured":"L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proc. ACM Symp. on Theory of Computing, pages 263\u2013277, 1981.","DOI":"10.1145\/800076.802479"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:28:01Z","timestamp":1556922481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_63","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}