NDLI: On the fault tolerance of some popular bounded-degree networks

Content Provider	IEEE Xplore Digital Library
Author	Leighton, T. Maggs, B. Sitaraman, R.
Copyright Year	1992
Description	Author affiliation: Dept. of Math., MIT, Cambridge, MA, USA (Leighton, T.)
Abstract	The authors analyze the fault-tolerance properties of several bounded-degree networks that are commonly used for parallel computation. Among other things, they show that an N-node butterfly containing N/sup 1- epsilon / worst-case faults (for any constant epsilon >0) can emulate a fault-free butterfly of the same size with only constant slowdown. Similar results are proved for the shuffle-exchange graph. Hence, these networks become the first connected bounded-degree networks known to be able to sustain more than a constant number of worst-case faults without suffering more than a constant-factor slowdown in performance. They also show that an N-node butterfly whose nodes fail with some constant probability p can emulate a fault-free version of itself with a slowdown of 2/sup O(log* N)/, which is a very slowly increasing function of N. The proofs of these results combine the technique of redundant computation with new algorithms for routing packets around faults in hypercubic networks. Techniques for reconfiguring hypercubic networks around faults that do not rely on redundant computation are also presented. These techniques tolerate fewer faults but are more widely applicable since they can be used with other networks such as binary trees and meshes of trees.<>
Starting Page	542
Ending Page	552
File Size	1101543
Page Count	11
File Format	PDF
ISBN	0818629002
DOI	10.1109/SFCS.1992.267797
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1992-10-24
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Fault tolerance Computer networks Computer science Mathematics National electric code Routing Contracts Laboratories Concurrent computing Binary trees
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Routing on butterfly networks with random faults

Fast fault-tolerant parallel communication for de Bruijn networks using information dispersal

On the Fault Tolerance of Some Popular Bounded-Degree Networks

Neural network routing for multiple stage interconnection networks

Conditional Fault-Tolerant Cycle-Embedding of Crossed Cube

Reconfiguration of binary trees in faulty hypercubes

On the embedding of a class of regular graphs in a faulty hypercube

On designing a reconfigurable fault-tolerant pyramid tree network architecture

Fault tolerant subcube allocation in hypercube

On the fault tolerance of some popular bounded-degree networks

Similar Documents

Routing on butterfly networks with random faults

Fast fault-tolerant parallel communication for de Bruijn networks using information dispersal

On the Fault Tolerance of Some Popular Bounded-Degree Networks

Neural network routing for multiple stage interconnection networks

Conditional Fault-Tolerant Cycle-Embedding of Crossed Cube

Reconfiguration of binary trees in faulty hypercubes

On the embedding of a class of regular graphs in a faulty hypercube

On designing a reconfigurable fault-tolerant pyramid tree network architecture

Fault tolerant subcube allocation in hypercube

On the fault tolerance of some popular bounded-degree networks