{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:39:18Z","timestamp":1742402358010,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_10","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"82-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Competitive source routing on tori and meshes"],"prefix":"10.1007","author":[{"given":"Tzuoo-Hawn","family":"Yeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"heng-Ming","family":"Kuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Laung","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In 33rd FOCS, pages 334\u2013343, 992.","DOI":"10.1109\/SFCS.1992.267757"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In 34th FOGS, pages 32\u201340, 1993.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In 25th STOC, pages 164\u2013173, 1993.","DOI":"10.1145\/167088.167142"},{"key":"10_CR4","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen. Competitive non-preemptive call control. In 5th SODA, pages 312\u2013320, 1994."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In 35th FOCS, pages 412\u2013423, 1994.","DOI":"10.1109\/SFCS.1994.365675"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In 24th STOC, pages 517\u2013580, 1992.","DOI":"10.1145\/129712.129768"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In 24th STOC, pages 39\u201350, 1992.","DOI":"10.1145\/129712.129717"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Y. Banal and A. Ros\u00e9n. The distributed k-server problem \u2014 a competitive distributed translator for k-server algorithms. In 33rd FOGS, pages 344\u2013353, 1992.","DOI":"10.1109\/SFCS.1992.267756"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"A. Borodin, P. Raghavan, B. Schieber, and E. Upfal. How much can hardware help routing. In 25th STOC, pages 573\u2013582, 1993.","DOI":"10.1145\/167088.167237"},{"key":"10_CR10","unstructured":"S. Irani, N. Reingold, J. Westbrook, and D. Sleator. Randomized competitive algorithms for the list update problem. In 2nd SODA, pages 251\u2013260, 1991."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight bounds for oblivious routing in the hypercube. In 2nd SPAA, pages 31\u201336, 1990.","DOI":"10.1145\/97444.97453"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. In 26th STOC, pages 507\u2013511, 1994.","DOI":"10.1145\/195058.195245"},{"issue":"1","key":"10_CR13","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01185337","volume":"9","author":"M. Kunde","year":"1993","unstructured":"M. Kunde. Packet routing on grids of processors. Algorithmica, 9(1):32\u201346, 1993.","journal-title":"Algorithmica"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"T. Leighton. Average case analysis of greedy routing algorithms on arrays. In 2nd SPAA, pages 2\u201310, 1990.","DOI":"10.1145\/97444.97448"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"T. Leighton, F. Makedon, and I. Tollis. A 2n \u22122 step algorithm for routing in an nx n array with constant size queues. In 1st SPAA, pages 328\u2013335, 1989.","DOI":"10.1145\/72935.72970"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"S. Rajasekaran and R. Overholt. Constant queue routing on a mesh. In 8th Annual Symposium on Theoretical Aspects of Computer Science, volume 480 of Lecture Nodes in Computer Science, pages 444\u2013455, Springer-Verlag, 1991.","DOI":"10.1007\/BFb0020819"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jagm.1995.0804","volume":"22","author":"J. Sibeyn","year":"1997","unstructured":"J. Sibeyn, B. Chlebus, and M. Kaufmann. Deterministic permutation routing on meshes. J. Algorithms, 22:111\u2013141, 1997.","journal-title":"J. Algorithms"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28:202\u2013208, 1985.","journal-title":"Comm. ACM"},{"issue":"4","key":"10_CR19","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/0196-6774(92)90061-G","volume":"13","author":"S. Vishwanathan","year":"1992","unstructured":"S. Vishwanathan. Randomized on-line graph coloring. J. Algorithms, 13(4):657\u2013669, 1992.","journal-title":"J. Algorithms"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"T.-H. Yeh, C.-M. Kuo, C.-L. Lei, and H.-C. Yen. Competitive source routing on tori and meshes. Technical report, Dept. of Electrical Engineering, National Taiwan University, 1996.","DOI":"10.1007\/3-540-63890-3_10"},{"issue":"6","key":"10_CR21","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N. Young","year":"1994","unstructured":"N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11(6):525\u2013541, 1994.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:21:07Z","timestamp":1740000067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"29 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}