Abstract
In this paper a fault tolerant routing algorithm for unicasting on star graph is proposed. The routing algorithm does not involve back tracking and uses fault-vectors. Each node in an n-star has a fault-vector of \(\lfloor\frac{3(n-1)}{2}\rfloor\) bits. The kth bit of a node’s fault-vector is a measure of its routing ability to nodes which are at distance k from itself. The fault-vector of each node can easily be calculated through \(\lfloor\frac{3(n-1)}{2}\rfloor\) rounds of information exchanges among neighbor nodes. For a given source destination pair (u,v), the routing algorithm finds a path of length d + h where d is the length of the shortest path between u and v in a fault-free star graph and h = 0, 2 or 4. The space requirement for storing the fault vector is O(n) in each node. Simulation results show that the proposed algorithm far outperforms the routing algorithm based on safety vectors [13].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akers, S.B., Harel, D., Krishnamurthy, B.: The star graph: An attractive alternative to the n-cube. In: Proceedings of International Conference on Parallel Processing, pp. 393–400 (1987)
Akers, S.B., Krishnamurthy, B.: The fault tolerance of star graphs. In: Houstis, E.N., Polychronopoulos, C.D., Papatheodorou, T.S. (eds.) ICS 1987. LNCS, vol. 297, pp. 270–276. Springer, Heidelberg (1988)
Akers, S.B., Krishnamurthy, B.: A group theoretic model for symmetric Interconnection Networks. IEEE Transaction on Computers 38, 555–566 (1989)
Rouskov, Y., Srimani, P.K.: Fault diameter of star graph. Information Processing Letters 48, 243–251 (1993)
Misic, J., Jovanovic, Z.: Routing function and deadlock avoidance in a star graph. Journal of Parallel and Distributed Computing, 216–228 (1994)
Sur, S., Srimani, P.K.: A fault tolerant routing algorithm in star graph interconnection networks. In: Proc. International Conference on Parallel Processing, pp. 267–270 (1991)
Bagherzadeh, N., Nassif, N., Latifi, S.: A routing and broadcasting scheme on faulty star graphs. IEEE Trans. on Computers 42, 1398–1403 (1993)
Mendia, V.E., Sarkar, D.: Optimal broadcasting on the star graph. IEEE Trans. on Parallel and Distributed Systems. 3, 389–396 (1992)
Gu, Q.P., Peng, S.: Node-to-node cluster fault routing in star graph. Information Processing letters 56, 29–35 (1995)
Day, K., Ayyoub, A.E.A.I.: Reliable Communication in faulty star. In: Proc. International Parallel and Distributed Processing Symposium, IPDPS (2002)
Wu, J.: Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors. IEEE Transaction on Parallel and Distributed Systems 9, 321–334 (1998)
Wu, J., Gao, F., Li, Z., Min, Y.: Optimal fault-tolerant routing in hypercubes using extended safety vectorsr. In: Proc. Seventh International conference on Parallel and Distributed Systems, ICPADS, pp. 267–271 (2000)
Yeh, S.-I., Yang, C.-B., Chen, H.-C.: Fault-tolerant routing on the star graph with safety vectors. In: Proc. of International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN, pp. 301–309 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, R.K. (2005). Fault Tolerant Routing in Star Graphs Using Fault Vector. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_52
Download citation
DOI: https://doi.org/10.1007/11603771_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)