Fault tolerant token ring embedding in double loop networks

Sung, Ting‐Yi; Lin, Chun‐Yuan; Chuang, Yen-Chu; Hsu, Lih-Hsing

doi:10.1016/s0020-0190(98)00066-0

Cited by 10 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fault tolerance is also desirable in massive parallel systems that have relatively high probability of failure. Much research have been proposed on the ring embedding problems in fault-tolerant networks [1,8,21,23,25,27].…”

Section: Introductionmentioning

confidence: 99%

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

et al. 2009

Self Cite

View full text Add to dashboard Cite

Processor (vertex) faults and link (edge) faults may happen when a network is used, and it is meaningful to consider networks (graphs) with faulty processors and/or links. A k-regular Hamiltonian and Hamiltonian connected graph G is optimal fault-tolerant Hamiltonian and Hamiltonian connected if G remains Hamiltonian after removing at most k − 2 vertices and/or edges and remains Hamiltonian connected after removing at most k − 3 vertices and/or edges. In this paper, we investigate in constructing optimal fault-tolerant Hamiltonian and optimal fault-tolerant Hamiltonian connected graphs. Therefore, some of the generalized hypercubes, twistedcubes, crossed-cubes, and Möbius cubes are optimal fault-tolerant Hamiltonian and optimal fault-tolerant Hamiltonian connected.

show abstract

Section: Introductionmentioning

confidence: 99%

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

et al. 2009

Self Cite

View full text Add to dashboard Cite

show abstract

“…There are many researches on the ring embedding problems in faulty interconnection networks [1,2,3,4,5]. There are a lot of mutually conflicting requirements in designing the topology of interconnection networks.…”

Section: Introductionmentioning

confidence: 99%

Optimal Fault-Tolerant Hamiltonian and Hamiltonian Connected Graphs

Chen

Huang

Hsu

et al. 2008

AIP Conference Proceedings

Self Cite

View full text Add to dashboard Cite

A fe-regular hamiltonian and hamiltonian connected graph G is optimal fault-tolerant hamiltonian and hamiltonian connected if G remains hamiltonian after removing at most k-2 nodes and/or edges and remains hamiltonian connected after removing at most fe -3 nodes and/or edges. In this paper, we investigate a construction scheme to construct optimal fault-tolerant hamiltonian and hamiltonian connected graphs. Hence, some of the generalized hypercubes. Twisted-cubes, Crossed-cubes, and Mobius cubes are optimal fault-tolerant hamiltonian and optimal fault-tolerant hamiltonian connected.

show abstract

“…Hence, using the notion of fault-tolerance the k-hamiltonian-connected graphs, kpancyclic graphs, and k-panconnected graphs can be defined similarly. Fault-tolerant hamiltonicity has been widely studied in many network topologies, such as hypercubes [26,30], de Bruijn networks [25], double loop networks [28], twisted cubes [14], and star graphs [31]. Other schemes to construct fault-tolerant hamiltonian-connected graphs can be found in [15,16,32].…”

Section: Introductionmentioning

confidence: 99%