Issue No. 10 - October (1991 vol. 40)

ISSN: 0018-9340

pp: 1167-1174

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.93750

ABSTRACT

<p>The authors introduce a novel class of networks based on the de Bruijn graph. These directed graphs are regular of degree, have N=k/sup n/ vertices for some n, and can tolerate up to k-2 node faults. Their fault-free diameter is n=log/sub k/N, and this is increases by at most 1 hop in the presence of k-2 faults. This class is very rich: for any given N=k/sup n/, one can construct at least 2/sup N/ different graphs. This is in sharp contrast to most other such constructions (including the de Bruijn graph), in which only one graph exists for each N. It is also shown how to implement certain algorithms on these networks.</p>

INDEX TERMS

fault tolerant networks; de Bruijn graph; directed graphs; vertices; node faults; fault-free diameter; hop; algorithm theory; directed graphs; fault tolerant computing.

CITATION

C. Raghavendra and M. Sridhar, "Fault-Tolerant Networks Based on the de Bruijn Graph," in

*IEEE Transactions on Computers*, vol. 40, no. , pp. 1167-1174, 1991.

doi:10.1109/12.93750

CITATIONS