On optimizing diameter and average distance of directed interconnected networks
Heinrich Braun, Frank Stephan · IEEE Transactions on Computers · 1993
A generic approach to constructing the topology of fixed degree directed networks for a given node degree and size is proposed. The topology has minimum diameter and makes it possible to answer Maekawa's problem partially. In addition, an expansion operator Ex(x,n) is provided to scale the network size. Fast routing algorithms for these networks that have logarithmic time complexity while using constant buffer size are presented.>