Sciweavers

Share
APCSAC
2005
IEEE

A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes

11 years 7 months ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up more slowly, they provide more choices of network size. Despite sparser connectivity, they allow efficient emulation of many other topologies. However, there is no existing fault-tolerant routing strategy for FCs or other node/link diluted cubes. In this paper, we propose a unified fault-tolerant routing strategy for all Fibonacci-class Cubes, tolerating as many faulty components as network node availability. The algorithm is livelock free and generates deadlock-free routes, whose length is bounded linearly to network dimensionality. As a component, a generic approach to avoiding immediate cycles is designed which is applicable to a wide range of inter-connection networks, with computational and spatial complexity at O(1) and O(n log n) respectively. Finally, the performance of the algorithm is presented and...
Zhang Xinhua, Peter Loh
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where APCSAC
Authors Zhang Xinhua, Peter Loh
Comments (0)
books