Abstract
The comparison of maximal and average node-to-node distances in recently introduced d-meshes, popular k-ary n-cubes, and more theoretical but in some cases near optimal permutation graphs is presented in this paper. The d-meshes are an extended family of two-dimensional regular meshes of an arbitrary degree d. They have the shortest maximal and average node-to-node distances, can be expanded in finer steps than both other topologies, and finally, d-meshes can be implemented on parallel planes carrying only parallel links.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
