✦ LIBER ✦

On the Fault Tolerance of Some Popular Bounded-Degree Networks

✍ Scribed by Leighton, F. Thomson; Maggs, Bruce M.; Sitaraman, Ramesh K.

Book ID: 118177355
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 447 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539793255163

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tolerating a Linear Number of Faults in

Tolerating a Linear Number of Faults in Networks of Bounded Degree

✍ E. Upfal 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Agreement in the presence of faults, on

Agreement in the presence of faults, on networks of bounded degree

✍ Michael Ben-Or; Dana Ron 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 540 KB

Tight Bounds on the Size of Fault-Tolera

Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults

✍ Leighton, Tom; Ma, Yuan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 328 KB

Bounds on the tolerance sensitivity of r

Bounds on the tolerance sensitivity of resistive networks

✍ Weyten, L. 📂 Article 📅 1984 🏛 IEEE ⚖ 490 KB

On the Construction of Fault-Tolerant Cu

On the Construction of Fault-Tolerant Cube-Connected Cycles Networks

✍ J. Bruck; R. Cypher; C.T. Ho 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 772 KB

This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole

On the Size of Permutation Networks and

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

✍ Hromkovič, Juraj; Kanarek, PrzemysŁawa; Klasing, Ralf; Loryś, Krzysztof; Unger, 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 671 KB