The Community for Technology Leaders
Green Image
<p>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.</p>
Maekawa problem; diameter; average distance; directed interconnected networks; routing algorithms; logarithmic time complexity; buffer size; computational complexity; directed graphs; minimisation of switching nets; multiprocessor interconnection networks.
H. Braun, F.C. Stephan, "On Optimizing Diameter and Average Distance of Directed Interconnected Networks", IEEE Transactions on Computers, vol. 42, no. , pp. 353-358, March 1993, doi:10.1109/12.210177
89 ms
(Ver 3.3 (11022016))