Node-to-node cluster fault tolerant routing in star graphs

DOI Web Site Web Site 2 Citations

Search this article

Description

In this paper, we proved (n-2,2) is an OCPT number of G n for node-to-node CFT routing. Our result shows that G n has very good node fault tolerant properties. We also give an algorithm which finds fault-free paths of length d(G n )+8 and of lenght at most d(G n )+6 in O(|F|+n) time and O(n 2 ) time, respectively, for any tolerable set F in the above problem. The problem of finding the optimal length of the fault-free path for node-to-node CFT routing in G n is open. It is interesting to find OCFT number for star graphs for d(F)>2. Investigating CFT routing properties and designing efficient CFT routing algorithms for other interconnection networks are certainly worth further research attention.

Journal

Citations (2)*help

See more

Report a problem

Back to top