A new bound for pure greedy hot potato routing

Abstract

We present a new bound for pure greedy hot potato routing onnxn mesh-connected arrays and n×n tori. For permutation problems the bound is O(n√n log n) steps which improves the for a long time known bound of O(n2). For the more general link-limited k-destination routing problem the bound is O{n√kn log n). The bound also holds for restricted pure greedy hot potato routing on n×n meshes with diagonals. The bound could be derived by a new technique where packets may have several identities. © Springer-Verlag Berlin Heidelberg 2007.