Elsevier

Computer Communications

Volume 17, Issue 11, November 1994, Pages 799-804
Computer Communications

Research note
Analysis of 1-ROR networks

https://doi.org/10.1016/0140-3664(94)90064-7Get rights and content

Abstract

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(N12) 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.

References (13)

  • MT Liu

    Distributed loop computer networks

  • CL Seitz

    The cosmic cube

    Commun. ACM

    (January 1985)
  • LD Wittie

    Communication structures for large networks of microcomputers

    IEEE Trans. Comput.

    (April 1981)
  • H Sullivan et al.

    A large scale, homogeneous, fully distributed parallel machine

  • FP Preparta et al.

    The cube connected cycles: a versatile network for parallel computation

    Commun. ACM

    (May 1981)
  • BW Arden et al.

    Analysis of chordal ring networks

    IEEE Trans. Comput.

    (April 1981)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1994 Published by Elsevier B.V.