Fault-tolerant message routing in hypercube using local neighborhood information

Derek C. W. Pao, Chi Kueng Chan

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

We present fault-tolerant message (packet) routing algorithms for hypercube that make use of the 2-neighborhood information. Our algorithms can tolerate (i) up to n faulty components in any Hamming ball of radius 3, and (ii) up to n-1 faulty components in the Hamming ball of radius 2 centered at the destination node. The path length of the packet is less than or equal to 3k, where k is the Hamming distance from the source to destination. We also show that Ω(k2) faults are required to make a packet to undertake a route of length 3k. Simulation study of the performance of the routing algorithms is presented. The structured buffer pool technique can be incorporated into our routing algorithms to prevent deadlock from occurring.
Original languageEnglish
Title of host publicationProceedings of TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology'
PublisherIEEE
Pages440-444
Volume1
ISBN (Print)0-7803-1862-5
DOIs
Publication statusPublished - Aug 1995
Event1994 IEEE Region 10's 9th Annual International Conference (TENCON'94) - , Singapore
Duration: 22 Aug 199426 Aug 1994

Conference

Conference1994 IEEE Region 10's 9th Annual International Conference (TENCON'94)
PlaceSingapore
Period22/08/9426/08/94

Fingerprint

Dive into the research topics of 'Fault-tolerant message routing in hypercube using local neighborhood information'. Together they form a unique fingerprint.

Cite this