Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

IPPS
1998
IEEE

favoriteEmaildiscussreport

102views Distributed And Parallel Com...» more IPPS 1998»

Fault-Tolerant Broadcasting in Toroidal Networks

13 years 8 months ago

Fault-Tolerant Broadcasting in Toroidal Networks

Download ipdps.cc.gatech.edu

A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a fault-free k-ary n-cube, the proposed algorithm requires at most 3 extra communication steps in the case of cut through packet routing and n + 1 extra steps in the case of store-and-forward routing. Conditions under which this algorithm works correctly in a general toroidal network are given.

Bader Almohammad, Bella Bose

Real-time Traffic

Algorithm | Distributed And Parallel Computing | Fault-tolerant Broadcasting Algorithm | IPPS 1998 | Optimal Algorithm |

claim paper

Related Content

» Comparison of Failure Detectors and Group Membership Performance Study of Two Atomic Broad...

» Fault Tolerant AlltoAll Broadcast in General Interconnection Networks

» Round Robin Is Optimal for FaultTolerant Broadcasting on Wireless Networks

» FaultTolerant DistributedSharedMemory on a BroadcastBased Interconnection Network

» Achieving FaultTolerant Ordered Broadcasts in CAN

» FaultTolerant kFold Pivot Routing in Wireless Sensor Networks

» A Case Study in the Mechanical Verification of Fault Tolerance

» Fault Tolerant Wireless Sensor MAC Protocol for Efficient Collision Avoidance

» Binomial Graph A Scalable and FaultTolerant Logical Network Topology

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	IPPS
Authors	Bader Almohammad, Bella Bose

Comments (0)