Analysis of 1-ROR networks

In this research note, we propose and analyse the Ring of Rings network (1-ROR), an improvization on the simple ring network. It is shown that the network has a diameter of O(N^1^2) with N nodes if the parameters are chosen properly. The expressions for the average path length and diameter of the 1-ROR network are formulated. A simple, dynamic shortest-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.

[1]  Theodore R. Bashkow,et al.  A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.

[2]  B W Arden,et al.  Analysis of Chordal Ring Network , 1981, IEEE Transactions on Computers.

[3]  David Gelernter,et al.  Staged circuit switching for network computers , 1983, SIGCOMM 1983.

[4]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  Yoram Ofek,et al.  Integration of multi-ring on the MetaRing architecture , 1990, [1990] Proceedings. Second IEEE Workshop on Future Trends of Distributed Computing Systems.

[6]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[7]  Pitro Alois Zafiropulo.  Reliability Optimization in Multiloop Communication Networks , 1973, IEEE Trans. Commun..

[8]  Cauligi S. Raghavendra,et al.  Double Loop Network Architectures - A Performance Study , 1985, IEEE Transactions on Communications.

[9]  D. Grunwald,et al.  The Performance of Multicomputer Interconnection Networks , 1987, Computer.

[10]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[11]  Ming T. Liu.  Distributed Loop Computer Networks , 1978, Adv. Comput..