Double loop networks with minimum delay
Double loop networks have been widely studied as practical and reliable computer networks. Let N denote the number of stations in a double loop network. The literature has proposed a topology which yields the diameter \(2\sqrt{N}\). In this paper we give a heuristic method which finds a topology with diameter roughly \(\sqrt{3N}\) for large N. We also give several infinite classes of values of N for which topologies are found that achieve the lower bound \(\lceil \sqrt{3N}\rceil -2\) for the diameter.
scientific article; zbMATH DE number 3995413