D-Trees: A Class of Dense Regular Interconnection Topologies

In this paper we propose a class of dense regular hierarchical interconnection topologies called D-trees. These topologies are denser than the interconnection networks in use today such as the ring and the n-dimensional boolean hypercube, and compare favorably with other proposed interconnection schemes like the star graph and the pancake graph. In addition, the class of topologies proposed by us is more flexible in that both the degree and the diameter can be varied in the construction of the required topology. These topologies are also incrementally scalable in the number of nodes that can be connected. We derive expressions for the number of nodes that may be connected in this manner and the corresponding diameters of such topologies. We also compare them with the boolean hypercube and the star graph.

L. V. Kale and B. Ramkumar, "D-Trees: A Class of Dense Regular Interconnection
Topologies", Proceedings of the Frontiers of Massively Parallel Computation,
Oct 1988, pp. 207-210.

@INPROCEEDINGS{DTreesPFMPC88,
        author = "L. V. Kal{\'e} and B. Ramkumar",
        title = "D-Trees: {A} Class of Dense Regular
Interconnection Topologies",
        booktitle ="Proceedings of the Frontiers of Massively
Parallel Computation",
        month = "Oct", 
        year = "1988", 
        pages = "207-210",
        annote = "88-2",
        group = Y,
}