Finding a fault tolerant routing on neighbour-faulty hypercube

Abstract

It is important for a communication network to route data efficiently among nodes. Efficient routing can be achieved by using node-disjoint paths. Routing by node-disjoint paths among nodes cannot only avoid communication bottlenecks, and thus increase the efficiency of message transmission, and also provide alternative paths in case of node failures. The one-to-one routing constructs the maximum number of node-disjoint paths in the network between the two given nodes. Optimal algorithms have proved sufficiency in designing efficient and fault tolerant routing algorithms on hypercube networks. In this article, firstly, we give the concepts of neighbourhood and accessibility in a graph, which is a model of a communication network. After, we give a fault tolerant routing algorithm using cube algebra for faulty hypercube that is proceeded from neighbour notion.

E-mail: [email protected]

Keywords:

• Graph theory
• Hypercube
• Routing
• Cube algebra
• Connectivity

Notes

E-mail: [email protected]