Optimal broadcasting in all-port meshes of trees with distance-insensitive routing
Petr Salinger, Pavel Tvrdı́k · 2002
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-and-forward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-to-all broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability.