Title :
Analysis of Chordal Ring Network
Author :
Arden, Bruce W. ; Lee, Hikyu
Author_Institution :
Department of Electrical Engineering and Computer Science, Princeton University
fDate :
4/1/1981 12:00:00 AM
Abstract :
A family of regular graphs of degree 3, called Chordal Rings, is presented as a possible candidate for the implementation of a local network of message-connected (micro) computers. For a properly constructed graph in this family having n nodes the diameter, or maximum length message path, is shown to be of 0(n 1/2). The symmetry of the graphs makes it possible to determine message routing by using a simple distributed algorithm. The given algorithm is also potentially useful for the determination of alternate paths in the event of node or link failure.
Keywords :
Chordal Ring; distributed routing; message-passing; multi- (micro) computer systems; regular networks; Computer architecture; Computer networks; Concurrent computing; Distributed algorithms; Distributed computing; Integrated circuit interconnections; Microprocessors; Operating systems; Partial differential equations; Routing; Chordal Ring; distributed routing; message-passing; multi- (micro) computer systems; regular networks;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1981.1675777
