✦ LIBER ✦

Optimal fault-tolerant routings for connected graphs

✍ Scribed by Koichi Wada; Yupin Luo; Kimio Kawaguchi

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 455 KB
Volume: 41
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90048-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Highly Fault-Tolerant Routings and Fault

Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs

✍ Koichi Wada; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ρ for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ρ)/F, where

Fault-tolerant graphs for tori

✍ Yamada, Toshinori; Ueno, Shuichi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H, construct a graph G from H by adding a minimum number D(t, H) of edges such that even after deleting any t edges from G the remaini

Cluster fault-tolerant routing in star g

Cluster fault-tolerant routing in star graphs

✍ Gu, Qian-Ping; Peng, Shietung 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

Fault-tolerant routing is a key issue in computer/ communication networks. We say a network (graph) can tolerate l faulty nodes for a routing problem if after removing at most l arbitrary faulty nodes from the graph the routing paths exist for the routing problem. However, the bound l is usually a w

Optimal replacement for fault-tolerant s

Optimal replacement for fault-tolerant systems

✍ Howard M. Taylor; Beatriz E. Rodriguez 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 531 KB

We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distinguishable, and the state of the system is given by knowing exactly which components are operational and which have failed. The individual component failure rates depend on the

Construction schemes for fault-tolerant

Construction schemes for fault-tolerant Hamiltonian graphs

✍ Wang, Jeng-Jung; Hung, Chun-Nan; Tan, Jimmy J. M.; Hsu, Lih-Hsing; Sung, Ting-Yi 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 2 views

In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show that applying these construction schemes on fault-tolerant Hamiltonian graphs generates graphs preserving the original Hamiltonicity property. We apply these construction schemes to generate some know

On the fault-tolerant diameter and wide

On the fault-tolerant diameter and wide diameter of ω-connected graphs

✍ Jian-Hua Yin; Jiong-Sheng Li; Guo-Liang Chen; Cheng Zhong 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB