Fault-tolerant routing for complete Josephus cubes

  • Authors:
  • Peter K. K. Loh;W. J. Hsu

  • Affiliations:
  • Division of Computing Systems, School of Computer Engineering, Nanyang Technological University, Blk N4, 2A-36, Nanyang Avenue, Singapore 639798, Singapore;Division of Computing Systems, School of Computer Engineering, Nanyang Technological University, Blk N4, 2A-36, Nanyang Avenue, Singapore 639798, Singapore

  • Venue:
  • Parallel Computing - Special issue: High-performance parallel bio-computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes and analyses a fault-tolerant routing system for the Complete Josephus Cube [Parallel Computing 26 (2000) 427]. For a Complete Josephus Cube of dimension r, the routing strategy tolerates at least (r + 1) and up to 2(r - 1) encountered component faults. Routes generated are free from cycles and guarantee message delivery. Within stated fault conditions, the message is routed within a maximum of (2(r - 1)) hops. The message overhead incurred is low for the specified fault tolerance level. Finally, our router design shows that hardware support may be simply achieved with practical components, facilitating integration with the host network.