Date Added: Dec 2010
An efficient distributed fault-tolerant routing algorithm for the Hypercubic P2P Grid systems is proposed and analyzed. A Hypercubic P2P Grid is a novel interconnection network with each node having an additional links that connects to node in different dimension. Node failure and link failure may occur dynamically in grid system provided that the total number of faulty nodes at any time is the node connectivity n of the HPGRID while it is less than the node-connectivity n of the n-cube. In HPGRID of dimension n, the strategy tolerates up to n encountered faults in its routes that are deadlock free and livelock free.