Completely connected ring-groups networks for autonomous decentralized systems

Author

Kobayashi, Hiromi

Author_Institution

Dept. of Manage. Eng., Tokai Univ., Hiratsuka, Japan

fYear

1995

fDate

25-27 Apr 1995

Firstpage

55

Lastpage

62

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(√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

Keywords

computer networks; distributed processing; fault tolerant computing; message passing; multiprocessor interconnection networks; network routing; parallel architectures; ADS; CCR network; autonomous decentralized systems; completely connected ring-groups networks; degree 3 networks; fault-tolerant routing scheme; group extension facility; interconnection networks; message routing; network diameter; network symmetry; node failure; ring groups; routing schemes; Broadcasting; Communication system control; Computer networks; Distributed algorithms; Engineering management; Fault tolerance; Multiprocessor interconnection networks; Network topology; Routing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Autonomous Decentralized Systems, 1995. Proceedings. ISADS 95., Second International Symposium on

Conference_Location

Phoenix, AZ

Print_ISBN

0-8186-7087-8

Type

conf

DOI

10.1109/ISADS.1995.398955

Filename

398955