Simple design algorithms for interconnected bus networks

Simple strategies are analyzed for the layout of networks of interconnected buses. The networks considered have topologies of a square grid and a mesh of cubes of buses. These regular topologies have properties that are desirable for very large high-speed networks. The objective of the design strategies is to minimize the maximum bus length. To demonstrate the effectiveness of the algorithms, it is shown that if there are a large number of communication nodes placed randomly on the unit square then the strategies produce, with high probability, layouts that have maximum bus lengths of at most a constant factor of the minimum