Abstract
This paper proposes a node-to-set node-disjoint routing algorithm based on a path storage model for the hypercube networks with faulty nodes. Two properties of the storage model are listed in the paper on condition that the n-dimension hypercube has no more than n-1 faulty nodes. The first is that its path length is no more than hamming distance plus 2, and the second is that its sub-cube model can be partitioned from the global model. Based on the model, a novel routing algorithm is brought up to generate node-to-set node-disjoint fault-tolerant path. It adopts divide-and-conquer strategy to take full advantage of the regularity of hypercube. The routing algorithm can reduce the path length to n +f + 2 at most and decrease the time complexity to O(mn) in a faulty-node hypercube system(where n is the number of dimensions, m is the number of destination nodes and f is number of faulty nodes). Experiment results show that the average path length is shorten by 9~10% compared with existing algorithms in a ten-dimension hypercube with no more than nine faulty nodes.
This is a preview of subscription content, log in via an institution to check access.
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
Lu, S., Yang, X.D.: A Multicast Path Algorithm on Hypercube Interconnection Networks. In: Proceedings of IEEE International Conference on High Performance Computing and Communications, Dalian, China, pp. 641–646 (2008)
Duoto, J., Yalamanchili, S., Ni, L.: Interconnection Networks: an Engineering Approach, pp. 149–160. Morgan Kaufmann Publishers (2002)
Gao, F., Li, Z.C., Min, Y.H., Wu, J.: A fault-tolerant routing strategy based on extended safety vectors in hypercube multicomputers. Chinese Journal of Computers 23(3), 248–254 (2000) (in Chinese with English abstract)
Home TOP500 Supercomputer Sites, http://www.top500.org/ (accessed October 12, 2013)
Dasgupta, M., Choudhury, S., Chaki, N.: A Secure Hypercube based Team Multicast Routing Protocols (S-HTMRP). In: Advance Computing Conference, pp. 1265–1269 (2009)
Liu, Y., Liu, H., Zhang, Y.: The connectivity of edge-fault-tolerant enhanced hypercube. In: 2011 International Conference on Electric Information and Control Engineering (ICEICE), April 15-17, pp. 805–807 (2011), doi:10.1109/ICEICE.2011.5777262
Lu, S., Fan, B.H., Dou, Y.: Clustering Multicast on Hypercube Network. In: Proceedings of IEEE International Conference on High Performance Computing and Communications, Munich, Germany, pp. 61–70 (2006)
Qiu, K.: An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube. In: 14th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2008, December 8-10, pp. 43–47 (2008), doi:10.1109/ICPADS.2008.119
Sinanoglu, O., Karaata, M.H., AlBdaiwi, B.: An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks. IEEE Transactions on Computers 59(7), 995–999 (2010), doi:10.1109/TC.2010.76
Lai, C.-N.: Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications. IEEE Transactions on Parallel and Distributed Systems 23(6), 1129–1134 (2012), doi:10.1109/TPDS.2011.261
Zhang, Y., Liu, H.: The Disjoint Paths in Enhanced Hypercube. In: 2010 International Conference of Information Science and Management Engineering (ISME), August 7-8, vol. 1, pp. 54–56 (2010), doi:10.1109/ISME.2010.82
Cheng, E., Gao, S., Qiu, K., Shen, Z.: On Disjoint Shortest Paths Routing on the Hypercube. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol. 5573, pp. 375–383. Springer, Heidelberg (2009)
Gu, Q., Peng, S.: An Efficient Algorithm for Node-to-node Routing in Hypercubes with Faulty Clusters. The Computer Journal 39(1), 14–19 (1996)
Gu, Q., Peng, S.: Node-to-set and Set-to-set Cluster Fault Tolerant Routing in Hypercubes. Parallel Computing 24(8), 1245–1261 (1998)
Bossard, A., Kaneko, K., Peng, S.: Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. In: Hsu, C.-H., Yang, L.T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010, Part I. LNCS, vol. 6081, pp. 511–519. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, E., Wang, H., Chen, J., Gong, W., Ni, F. (2014). A Novel Node-to-Set Node-Disjoint Fault-Tolerant Routing Strategy in Hypercube. In: Wu, J., Chen, H., Wang, X. (eds) Advanced Computer Architecture. Communications in Computer and Information Science, vol 451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44491-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-44491-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44490-0
Online ISBN: 978-3-662-44491-7
eBook Packages: Computer ScienceComputer Science (R0)