In this research note, we propose and analyse the Ring of Rings networ
k (1-ROR), an improvization on the simple ring network. It is shown th
at the network has a diameter of O(N1/2) with N nodes if the parameter
s are chosen properly. The expressions for the average path length and
diameter of the 1-ROR network are formulated. A simple, dynamic short
est-path routing algorithm for the network is also presented. Finally,
we propose simple extensions to the basic 1-ROR network which improve
some of its properties.