Issue No.12 - December (1993 vol.42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.260637
<p>A method of embedding a ring in a d-ary de Bruijn multiprocessor network in the event of multiple node (processor) failures is presented. In particular, the algorithm guarantees that a (2/sup n/-n-1)-node ring will be found in a binary de Bruijn network with a single faulty node, where 2/sup n/ is the total number of nodes in the network. It is also shown that a (d/sup n/-1)-node ring can always be found in the presence of d-1 link failures, when d is a prime power and the network contains d/sup n/ nodes. The latter is accomplished by constructing d-1 edge-disjoint cycles each of length d/sup n/-1. A modification of the graph that allows it to admit a Hamiltonian cycle in the event of d-1 edge failures is also discussed.</p>
fault tolerant computing; hypercube networks; fault-tolerant ring embedding; de Bruijn networks; multiprocessor network; multiple node (processor) failures; prime power; Hamiltonian cycle.
R.A. Rowley, "Fault-Tolerant Ring Embedding in de Bruijn Networks", IEEE Transactions on Computers, vol.42, no. 12, pp. 1480-1486, December 1993, doi:10.1109/12.260637