Are 2*-trees interesting topologies for the interconnection of a network?

In this paper, we explore in detail some properties of 2*-trees. A 2*-tree is a connected graph with N nodes, diameter log₂N, and degree of nodes 10. We propose routing algorithms for the unicasting, the broadcasting and the gossiping on a 2*-tree network. The routing algorithms we present have their time and communication complexities lower than the corresponding complexities for the routing on H_n, i.e., the hypercube of dimension n=log₂N. Consequently, we think that a 2*-tree is an interesting topology to be considered for a network of processors