✦ LIBER ✦

Node-to-node cluster fault tolerant routing in star graphs

✍ Scribed by Qian-Ping Gu; Shietung Peng

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 625 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00135-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Node-to-set and set-to-set cluster fault

Node-to-set and set-to-set cluster fault tolerant routing in hypercubes

✍ Qian-Ping Gu; Shietung Peng 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 365 KB

We study node-to-set and set-to-set fault tolerant routing problems in n-dimensional hypercubes r n . Node-to-set routing problem is that given a node s and a set of nodes path connects a node of and a node of . From Menger's theorem, it is known that these two problems in r n can tolerate at most

Node fault tolerance in graphs

✍ Harary, Frank; Hayes, John P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB 👁 2 views

A graph G \* is a k-node fault-tolerant supergraph of a graph G , denoted k-NFT( G), if every graph obtained by removing k nodes from G\* contains G. A k-NFT(G) graph G\* is said to be optimal if it contains n + k nodes, where n is the number of nodes of G and G \* has the minimum number of edges am

Node-to-set disjoint paths problem in st

Node-to-set disjoint paths problem in star graphs

✍ Qian-Ping Gu; Shietung Peng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 567 KB

GivenanodesandasetZ'={t~,..., tk} of k nodes in a k-connected graph, the node-to-set disjoint paths problem is to find k node-disjoint paths pi : s -+ ti, 1 < i < k. In this paper, we give two O(n\*) time algorithms for the node-to-set disjoint paths problem in n-dimensional star graphs G, which are