{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:52:02Z","timestamp":1787496722578,"version":"build-2736575974"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01784239","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T11:35:21Z","timestamp":1119180921000},"page":"3-19","source":"Crossref","is-referenced-by-count":12,"title":["Greedy hot-potato routing on the two-dimensional mesh"],"prefix":"10.1007","volume":"9","author":[{"given":"Ishai","family":"Ben-Aroya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tamar","family":"Eilam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Assaf","family":"Schuster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01784239_CR1","doi-asserted-by":"crossref","unstructured":"Acampora AS, Shah SIA: Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. IEEE INFOCOM, pp 10\u201319 (1991)","DOI":"10.1109\/INFCOM.1991.147478"},{"issue":"10","key":"BF01784239_CR2","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/12.35831","volume":"38","author":"HG Badr","year":"1989","unstructured":"Badr HG, Podar S: An optimal shortest-path routing policy for network computers with regular mesh-connected topologies. IEEE Trans Comput 38 (10): 1362\u20131371 (1989)","journal-title":"IEEE Trans Comput"},{"key":"BF01784239_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Noy A, Raghavan P, Schieber B, Tamaki H: Fast deflection routing for packets and worms. In: Proc 12th ACM Symposium on Principles of Distributed Computing, 1993","DOI":"10.1145\/164051.164062"},{"key":"BF01784239_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCOM.1964.1088883","volume":"12","author":"P Baran","year":"1964","unstructured":"Baran P: On distributed communications networks. IEEE Trans Commun 12: 1\u20139 (1964)","journal-title":"IEEE Trans Commun"},{"key":"BF01784239_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Aroya I, Newman I, Schuster A: Randomized single target hot potato routing. In: Proc 3rd Israeli Symposium on the Theory of Computing and Systems, pp 20\u201329, January 1995 (Also Technion\/LPCR TR#9406, June 1994)","DOI":"10.1109\/ISTCS.1995.377050"},{"key":"BF01784239_CR6","unstructured":"Ben-Aroya I, Schuster A: A CLT-type lower bound for hot-potato permutation routing. TR LPCR #9405, CS Dept Technion, May 1994"},{"key":"BF01784239_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Aroya I, Schuster A: Greedy hot-potato routing on the two-dimensional mesh. In: 2nd European Symposium on Algorithms, Utrecht, September 1994 (Also Technion\/LPCR TR #9320, November 1993)","DOI":"10.1007\/BFb0049423"},{"key":"BF01784239_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Dor A, Halevi S, Schuster A: Potential function analysis of greedy hot-potato routing. In: Proc of 13th ACM Symposium on Principles of Distributed Computing, Los Angeles, August 1994","DOI":"10.1145\/197917.198098"},{"key":"BF01784239_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A Borodin","year":"1985","unstructured":"Borodin A, Hopcroft JE: Routing, merging, and sorting on parallel models of computation. J Comput Syst Sci 30: 130\u2013145 (1985)","journal-title":"J Comput Syst Sci"},{"key":"BF01784239_CR10","unstructured":"Borodin A, Rabani Y, Schieber B: Deterministic many-to-many hot potato routing, 1994"},{"key":"BF01784239_CR11","unstructured":"Brassil JT, Cruz RL: Bounds on maximum delay in networks with deflection routing. In: 29th Annual Allerton Conference on Communication, Control and Computing, pp 571\u2013580, 1991 (To appear IEEE TPDS)"},{"key":"BF01784239_CR12","doi-asserted-by":"crossref","unstructured":"Feige U: Observations on hot potato routing. In: Proc 3rd Israeli Symposium on the Theory of Computing and Systems, pp 30\u201339, January 1995","DOI":"10.1109\/ISTCS.1995.377049"},{"key":"BF01784239_CR13","doi-asserted-by":"crossref","unstructured":"Feige U, Raghavan P: Exact analysis of hot-potato routing. In: Proc IEEE Symposium on Foundations of Computer Science, November 1992","DOI":"10.1109\/SFCS.1992.267796"},{"key":"BF01784239_CR14","first-page":"255","volume-title":"Teletraffic Analysis and Computer Performance Evaluation","author":"AG Greenberg","year":"1986","unstructured":"Greenberg AG, Goodman J: Sharp approximate models of adaptive routing in mesh networks. In: Boxma OJ, Cohen JW, Tijms HC (eds) Teletraffic Analysis and Computer Performance Evaluation. Elsevier, Amsterdam 1986, pp 255\u2013270 (Revised 1988)"},{"key":"BF01784239_CR15","doi-asserted-by":"crossref","unstructured":"Greenberg AG, Hajek B: Deflection routing in hypercube net-works. IEEE Trans Commun June 1992","DOI":"10.1109\/26.142797"},{"key":"BF01784239_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02311228","volume":"5","author":"B Hajek","year":"1991","unstructured":"Hajek B: Bounds on evacuation time for deflection routing. Distrib Comput 5: 1\u20136 (1991)","journal-title":"Distrib Comput"},{"key":"BF01784239_CR17","unstructured":"Hillis WD: The Connection Machine. MIT Press 1985"},{"key":"BF01784239_CR18","doi-asserted-by":"crossref","unstructured":"Kaklamanis C, Krizanc D, Rao S: Hot-potato routing on processor arrays. In: Symposium of Parallel Algorithms and Architectures, 1993","DOI":"10.1145\/165231.376321"},{"key":"BF01784239_CR19","unstructured":"Lawrie DH, Padua DA: Analysis of message switching with shuffle-exchanges in multi-processors. In: Proc Workshop on Interconnection Networks for Parallel and Distributed Computing, pp 116\u2013123, 1980"},{"key":"BF01784239_CR20","unstructured":"Leighton FT: Introduction to parallel algorithms and architectures. Morgan Kaufmann 1992."},{"key":"BF01784239_CR21","doi-asserted-by":"crossref","unstructured":"Maxemchuk NF: Comparison of deflection and store and forward techniques in the manhattan street and shuffle exchange networks. IEEE INFOCOM, pp 800\u2013809 (1989)","DOI":"10.1109\/INFCOM.1989.101529"},{"key":"BF01784239_CR22","unstructured":"Newman I, Schuster A: Hot-potato algorithms for permutation routing. TR PCL Report #9201, CS Dept Technion, November 1992"},{"key":"BF01784239_CR23","doi-asserted-by":"crossref","unstructured":"Ngai JY, Seitz CL: A framework for adaptive routing in multicomputer networks. In: Proc 1st Annual Symposium on Parallel Algorithms and Architectures, pp 1\u20139. ACM, 1989","DOI":"10.1145\/72935.72936"},{"key":"BF01784239_CR24","unstructured":"Prager R: An algorithm for routing in hypercube networks. Master's thesis, 1986"},{"key":"BF01784239_CR25","unstructured":"Seitz CL, Boden N, Seizovic J, Su W: The design of the Caltech Mosaic C multicomputer. In: Proc Symposium on Integrated Systems, pp 1\u201322, 1993"},{"key":"BF01784239_CR26","doi-asserted-by":"crossref","unstructured":"Smith B: Architecture and applications of the HEP multiprocessor computer system. In: Proc (SPIE) Real Time Signal Processing IV, pp 241\u2013248, 1981","DOI":"10.1117\/12.932535"},{"key":"BF01784239_CR27","doi-asserted-by":"crossref","unstructured":"Szymanski T: An analysis of hot potato routing in a fiber optic packet switched hypercube. In: IEEE INFOCOM, pp 918\u2013926 (1990)","DOI":"10.1109\/INFCOM.1990.91340"},{"key":"BF01784239_CR28","doi-asserted-by":"crossref","unstructured":"Zhang Z, Acampora AS: Performance analysis of multihop light-wave networks with hot potato routing and distance age priorities. In: IEEE INFOCOM, pp 1012\u20131021 (1991)","DOI":"10.1109\/INFCOM.1991.147615"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784239.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01784239\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T15:36:04Z","timestamp":1735745764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01784239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01784239"],"URL":"https:\/\/doi.org\/10.1007\/bf01784239","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}