65
Views
1
CrossRef citations to date
0
Altmetric
Miscellany

Finding a fault tolerant routing on neighbour-faulty hypercube

Pages 1043-1049 | Received 12 Jan 2004, Published online: 25 Jan 2007
 

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]

Notes

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.