01157nas a2200121   4500008004100000245007600041210006900117300001500186520065800201100001900859700002700878856013000905       1997                        eng d00aPure greedy Hot-Potato routing in the 2-d mesh with random destinations0 aPure greedy HotPotato routing in the 2d mesh with random destina  a 249 - 2583 aWe analyze here a pure greedy hot-potato routing strategy on a two-dimensional
mesh of n^2 nodes. We specifically study the case of n^
2 packets, originating one per
node, to be delivered at random uniform destinations. Each packet attempts to follow
the shortest path leading first to the destination row/column (whichever is closest) and
then to the actual destination node. A de
ection policy is adopted to solve con
icts. We prove that all packets are delivered to the destinations in average time O(nlogn). The
average is taken over all possible destination functions. No average case analysis of pure
greedy hot-potato routing was known up to now.1 aSpirakis, Paul1 aTriantafillou, Vasilis  uhttps://telematics.upatras.gr/telematics/publications/pure-greedy-hot-potato-routing-2-d-mesh-random-destinations?language=el