A fault tolerant routing algorithm based on cube algebra for hypercube systems

13 years 4 months ago

Download ube.ege.edu.tr

We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may be rather large and if any path between the nodes exists, the developed algorithm determines it. To construct this algorithm, some properties of the cube algebra are considered and some transformations based on this algebra are developed.

Novruz M. Allahverdi, Sirzad S. Kahramanli, Kayhan

Real-time Traffic

Faulty Nodes | JSA 2000 | Nonfaulty Hypercube | Shortest Path |

claim paper

» Fault Tolerant Subcube Allocation in Hypercubes

» A FaultTolerant Routing Strategy for FibonacciClass Cubes

» Adaptive FaultTolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection

» Oblivious DeadlockFree Routing in a Faulty Hypercube

» Nearly Optimal OneToMany Parallel Routing in Star Networks

» A Faulttolerant Routing Strategy for Gaussian Cube Using Gaussian Tree

» HGRID Fault Tolerant Log2N Resource Management for Grids

» Tolerating operational faults in clusterbased FPGAs

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JSA
Authors	Novruz M. Allahverdi, Sirzad S. Kahramanli, Kayhan Erciyes

Comments (0)

Sciweavers

A fault tolerant routing algorithm based on cube algebra for hypercube systems

Faulty Nodes | JSA 2000 | Nonfaulty Hypercube | Shortest Path |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers