TY - GEN
T1 - Hard-potato routing
AU - Busch, Costas
AU - Herlihy, Maurice
AU - Wattenhofer, Rogert
PY - 2000
Y1 - 2000
N2 - We present the first hot-potato routing algorithm for the n x n mesh whose running time on any quot;hardquot; (i.e., Ω(n)) "many-to-one" batch routing problem is, with high probability, within a polylogarithmic factor of optimal. For any instance I of a batch routing problem, there exists a well-known lower bound LBI based on maximum path length and maximum congestion. If LBI is Ω(n), our algorithm solves I with high probability in time O(LBI·log3 n). The algorithm is distributed and greedy, and it makes use of a new routing technique based on multi-bend paths, a departure from paths using a constant number of bends used in prior hot-potato algorithms.
AB - We present the first hot-potato routing algorithm for the n x n mesh whose running time on any quot;hardquot; (i.e., Ω(n)) "many-to-one" batch routing problem is, with high probability, within a polylogarithmic factor of optimal. For any instance I of a batch routing problem, there exists a well-known lower bound LBI based on maximum path length and maximum congestion. If LBI is Ω(n), our algorithm solves I with high probability in time O(LBI·log3 n). The algorithm is distributed and greedy, and it makes use of a new routing technique based on multi-bend paths, a departure from paths using a constant number of bends used in prior hot-potato algorithms.
UR - http://www.scopus.com/inward/record.url?scp=0033706883&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033706883&partnerID=8YFLogxK
U2 - 10.1145/335305.338762
DO - 10.1145/335305.338762
M3 - Conference contribution
AN - SCOPUS:0033706883
SN - 1581131844
SN - 9781581131840
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 278
EP - 285
BT - Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
T2 - 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
Y2 - 21 May 2000 through 23 May 2000
ER -