“…This enables us to control the positions of the packets and implicitly obtain the aforementioned paths P and a collision-free schedule on them. Hot-potato algorithms have been extensively studied for a variety of architectures such as the mesh and torus [7,9,10,14,16,18,19,20,25,26,29,30,31,39,48], hypercubes [13,15,26,28,42], trees [23,46], vertex-symmetric networks [36], and leveled networks [12,17,21]. Typically, by allowing packets to deviate slightly from their pre-selected paths, one obtains delivery times that are within poly-logarithmic factors of optimal.…”