Routing with locality on meshes with buses

Routing with locality is studied for meshes with buses. In this problem, packets' distances are bounded by a value, d, which is less than the diameter of the network. This problem arises naturally when specific known algorithms are implemented on meshes. Solving this problem in ordinary meshes requires at least a routing time of d steps. To do better than this, we propose adding a kind of short bus to ordinary meshes. By using a technique which we call iterative walk-and-ride, we show how the routing time can be reduced by approximately one-third for solving the problem (including the multipacket version) on one-and two-dimensional short-bus meshes. The bounds we develop are tight. © 1996 Academic Press, Inc.link_to_subscribed_fulltex

Routing with Locality on Meshes with Buses

This paper shows how to utilize these buses in some "high-bandwidth" routing problem