A method for automatic search for families of optimal chordal ring networks

Arden and Lee proposed a class of chordal ring networks of degree three as communication networks for multicomputer systems, derived a formula for the diameter, and produced an algorithm for finding the shortest paths for them. In this paper, it is shown that the formula for the diameter and the routing algorithm presented by them are inaccurate. We have obtained a large dataset containing parameters for describing optimal diameter chord rings for all the numbers of nodes up to 60 000 and found the exact lower bound for the diameter of chordal ring networks. A new method is proposed and the algorithms for automatic search for analytical descriptions of families of optimal chordal rings are realized based on an analysis of the database. Using the latter, analytical descriptions of over 500 new families of optimal chordal ring networks for many values of the number of nodes are found (only six families have been known until now in the literature). Tab. 5, illustr. 6, bibliogr. 26.