Second International Symposium on Autonomous Decentralized Systems (ISADS'95) Completely connected ring-groups networks for autonomous decentralized systems Phoenix, Arizona, USA April 25-April 27 ISBN: 0-8186-7087-8
Abstract: This paper presents some properties of completely connected ring-groups (CCR) networks and routing schemes for a type of autonomous decentralized system called ADS. The CCR network is a family of degree 3 networks, which is constructed using m+1 rings, each of which is defined as a group having m nodes. The distance between any two ring groups of the CCR network is always 1 regardless of the total number of nodes because all of the nodes in any group are directly connected to the nodes of every other group. The diameter in this network is of O(/spl radic/n). The group extension facility is presented in this paper. Two routing schemes for ADS and a fault-tolerant routing scheme for a node failure in this network are also presented. The symmetry of the network makes it simple to determine message routing.
Index Terms:
multiprocessor interconnection networks; distributed processing; parallel architectures; network routing; fault tolerant computing; message passing; computer networks; completely connected ring-groups networks; autonomous decentralized systems; routing schemes; ADS; CCR network; degree 3 networks; ring groups; network diameter; group extension facility; fault-tolerant routing scheme; node failure; message routing; network symmetry; interconnection networks
Citation:
H. Kobayashi, "Completely connected ring-groups networks for autonomous decentralized systems," isads, pp.0055, Second International Symposium on Autonomous Decentralized Systems (ISADS'95), 1995 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb