Regular d-neighbours topologies

Topological parameters and routing performances of regular d-neighbours topologies are analysed and discussed in this paper. Average and maximal distances between nodes are compared for hypercubes, 3D-tori, arrangement graphs and recently introduced d-meshes, an extended family of two-dimensional regular meshes of an arbitrary degree d and an isomorphic node neighbourhood. d-meshes are superior in node-to-node distances, in the expansion scalability and in the potential for a planar implementation.