
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.A. Sridhar, C.S. Raghavendra, "FaultTolerant Networks Based on the de Bruijn Graph," IEEE Transactions on Computers, vol. 40, no. 10, pp. 11671174, October, 1991.  
BibTex  x  
@article{ 10.1109/12.93750, author = {M.A. Sridhar and C.S. Raghavendra}, title = {FaultTolerant Networks Based on the de Bruijn Graph}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {10}, issn = {00189340}, year = {1991}, pages = {11671174}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.93750}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  FaultTolerant Networks Based on the de Bruijn Graph IS  10 SN  00189340 SP1167 EP1174 EPD  11671174 A1  M.A. Sridhar, A1  C.S. Raghavendra, PY  1991 KW  fault tolerant networks; de Bruijn graph; directed graphs; vertices; node faults; faultfree diameter; hop; algorithm theory; directed graphs; fault tolerant computing. VL  40 JA  IEEE Transactions on Computers ER   
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 k2 node faults. Their faultfree diameter is n=log/sub k/N, and this is increases by at most 1 hop in the presence of k2 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.
[1] A. V. Aho and M. J. Corasick, "Efficient string matching: An aid to bibliographic search,"Commun. ACM, pp. 333340, June 1975.
[2] S. B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to thencube," inProc. Int. Conf. Parallel Processing, Aug. 1987, pp. 393400.
[3] S. B. Akers and B. Krishnamurthy, "Group graphs as interconnection networks," inProc. 14th Int. Conf. Fault Tolerant Comput. Syst., June 1984, pp. 422427.
[4] A.H. Esfahanian and S. L. Hakimi, "Faulttolerant routing in de Bruijn communications networks,"IEEE Trans. Comput., vol. C34, pp. 777788, Sept. 1985.
[5] M. A. Fiol, J. L. A. Yebra, and I. Miquel, "Line digraph iterations and the (d, k)digraph problem,"IEEE Trans. Comput., vol. C33, pp. 400403, May 1984.
[6] H. Fredricksen, "A survey of full length nonlinear shiftregister cycle algorithms,"SIAM Rev., vol. 24, pp. 195221, Apr. 1982.
[7] R. L. Hemminger and L. W. Beineke, "Line graphs and line digraphs," inSelected Topics in Graph Theory, L. W. Beineke, Ed. New York: Academic, 1978.
[8] J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages, and Computation. Reading, MA: AddisonWesley, 1979.
[9] M. Imase and M. Itoh, "A design for directed graphs with minimum diameter,"IEEE Trans. Comput., vol. C32, pp. 782784, Sept. 1983.
[10] M. Imase and M. Itoh, "Design to minimize diameter on buildingblock network,"IEEE Trans. Comput., vol. C30, pp. 439443, June 1981.
[11] M. Imase, T. Soneoka, and K. Okada, "Connectivity of regular directed graphs with small diameter,"IEEE Trans. Comput., vol. C34, pp. 267273, Mar. 1985.
[12] D. E. Knuth, J. H. Morris, and V. R. Pratt, "Fast pattern matching in strings,"SIAM J. Comput., vol. 6, pp. 323350, June 1977.
[13] C. W. H. Lam and J. H. van Lint, "Directed graphs with unique paths of fixed lengths,"J. Combinatorial Theory, vol. B24, pp. 331337, 1978.
[14] A. Lempel, "On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers,"IEEE Trans. Comput., vol. C12, pp. 12041209, Dec. 1970.
[15] N. S. Mendelsohn, "Directed graphs with the unique path property," inCombinatorial Mathematics and its Applications, P. Erdos, A. Renyi and V. T. Sos, Eds., 1969.
[16] R. Y. Pinter, "Efficient string matching with don'tcare patterns," inCombinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds., NATO ASI Series, SpringerVerlag, 1985, pp. 1129.
[17] D. K. Pradhan, "Faulttolerant multiprocessor link and bus network architectures,"IEEE Trans. Comput., vol. C34, pp. 3345, Jan. 1985.
[18] D. K. Pradhan and S. M. Reddy, "A faulttolerant communication architecture for distributed systems,"IEEE Trans. Comput., vol. C31, pp. 863870, Sept. 1982.
[19] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[20] A. Sengupta, A. Sen, and S. Bandyopadhyay, "Faulttolerant distributed system design,"IEEE Trans. Circuits Syst., vol. CAS35, pp. 168172, Feb. 1988.
[21] A. Sengupta, A. Sen, and S. Bandyopadhyay, "On an optimally fault tolerant multiprocessor network architecture,"IEEE Trans. Comput., vol. C36, pp. 619623, May 1987.
[22] M. A. Sridhar, "On the connectivity of the de Bruijn graph,"Inform. Proc. Lett., vol. 27, pp. 315318, May 1988.
[23] M. A. Sridhar and C. S. Raghavendra, "Uniform minimal fullaccess networks,"J. Parallel Distributed Comput., vol. 5, pp. 383403, 1988.
[24] M. A. Sridhar, "Updating the AhoCorasick pattern matching machine,"Int. J. Comput. Math., to be published.