✦ LIBER ✦

Fault-Tolerant Multicasting on Hypercubes

✍ Scribed by A.C. Liang; S. Bhattacharya; W.T. Tsai

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 912 KB
Volume: 23
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1994.1151

No coin nor oath required. For personal study only.

✦ Synopsis

Multicast (one-to-many) communication has important applications in parallel architecture and communication networks. This paper considers the multicast problem for a (d) dimensional binary hypercube in the presence of (F) link failures, where (F<d). We develop a fault-tolerant (FT) multicast heuristic, namely lookahead-multicast, by including FT features into the existing faultfree hypercube multicast heuristic. The proposed FT multicast heuristic is deadlock-free and can ensure successful multicast. Reliability measures and simulation results are reported towards the performance of this approach. It is also compared with another FT multicast heuristic. O 1994 Academic Press, Inc.

📜 SIMILAR VOLUMES

Fault-Tolerant Permutation Routing in Hy

Fault-Tolerant Permutation Routing in Hypercubes

✍ Mee Yee Chan; Shiang-Jen Lee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Fault—tolerant hypercube broadcasting vi

Fault—tolerant hypercube broadcasting via information dispersal

✍ L. Gargano; A. A. Rescigno; U. Vaccaro 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 820 KB

Fault tolerance in Clos–Knockout multica

Fault tolerance in Clos–Knockout multicast ATM switch

✍ K. S. Chan; Sammy Chan; K. T. Ko 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

Some edge-fault-tolerant properties of t

Some edge-fault-tolerant properties of the folded hypercube

✍ Sun-Yuan Hsieh 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

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

The Flexible Hypercube: A New Fault-Tole

The Flexible Hypercube: A New Fault-Tolerant Architecture for Parallel Computing

✍ Tom Hameenanttila; Xin-Li Guan; Jo Dale Carothers; Jian-Xin Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 265 KB

This paper presents the new Flexible Hypercube architecture. The Flexible Hypercube is a fault-tolerant network topology that can be constructed for an arbitrary number of nodes and is incrementally expandable. This topology maintains the strong features of the Hypercube while overcoming deficiencie