By Topic

On optimizing diameter and average distance of directed interconnected networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Braun, H. ; Inst. of Logic, Complexity, & Deductive Syst., Karlsruhe Univ. ; Stephan, F.C.

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

Published in:

Computers, IEEE Transactions on  (Volume:42 ,  Issue: 3 )