Advertisement

Fault-Tolerant Adaptive Routing in n-D Mesh

  • Meirun ChenEmail author
  • Yi Yang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9998)

Abstract

Utilizing mobile cloud computing has had numerous advantages such as the reduction of costs, development of efficiency, unlimited storage capacity, easy access to services at any time and from any location. It should be mentioned that the provision of various mobile cloud computing services is faced with problems and challenges that the fault tolerance can be mentioned as the main restrictions. In this paper, we consider fault-tolerant adaptive routing in n-D mesh network. We propose a new faulty block model. All the faulty nodes and faulty links are surrounded in some block, which is a convex structure, in order to avoid routing livelock. The new model constructs the interior spanning forest for each block in order to keep in touch with the nodes inside of each block. The procedure for block construction is dynamically, it will adjust its scale in accordance with the situation of networks, either the fault emergence or the fault recovery. In our new adaptive routing, the message can be sent to its destination whether the destination is inside or outside a block if and only if the destination nodes keep connecting with the mesh networks.

Keywords

Adaptive routing Faulty block Cracky faulty block Livelock n-D mesh 

Notes

Acknowledgments

The authors would like to thank the Natural Science Foundation of China (11101345) and the Natural Science Foundation of Fujian Province (2016J01041).

References

  1. 1.
    Benkhelifa, E., Welsh, T., Tawalbeh, L., et al.: User profiling for energy optimisation in mobile cloud computing. Procedia Comput. Sci. 52, 1159–1165 (2015)CrossRefGoogle Scholar
  2. 2.
    Boppana, R.V., Chalasani, S.: Fault-tolerant wormhole routing algorithms for mesh networks. IEEE Trans. Comput. 44(7), 848–864 (1995)CrossRefzbMATHGoogle Scholar
  3. 3.
    Intel Corporation, A Touchstone DELTA System Description (1991)Google Scholar
  4. 4.
    Gai, K., Qiu, M., Zhao, H., Tao, L., Zong, Z.: Dynamic energy-aware cloudlet-based mobile cloud computing model for green computing. J. Netw. Comput. Appl. 59, 46–54 (2016)CrossRefGoogle Scholar
  5. 5.
    Liu, W., Nishio, T., Shinkuma, R., Takahashi, T.: Adaptive resource discovery in mobile cloud computing. Comput. Commun. 50(1), 119–129 (2014)CrossRefGoogle Scholar
  6. 6.
    Seitz, C.L.: The architecture and programming of the Amete Series 2010 multicomputer. In: Proceedings of Third Conference on Hypercube Concurrent Computer and Applications, pp. 33–36 (1988)Google Scholar
  7. 7.
    Su, C.C., Shin, K.G.: Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes. IEEE Trans. Comput. 45(6), 666–683 (1996)CrossRefzbMATHGoogle Scholar
  8. 8.
    Wang, D.: A rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in mesh. IEEE Trans. Comput. 52, 310–320 (2003)CrossRefGoogle Scholar
  9. 9.
    Wu, J.: Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels. IEEE Trans. Parallel Distrib. Syst. 11(2), 149–159 (2000)CrossRefGoogle Scholar
  10. 10.
    Yang, Y., Chen, M., Li, H., Li, L.: Adaptive fault-tolerant routing in 2D mesh with cracky rectangular model. J. Appl. Math. 10, 1–592638 (2014)MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.School of Applied MathematicsXiamen University of TechnologyXiamenChina
  2. 2.School of Information Science and EngineeringLanzhou UniversityLanzhouChina

Personalised recommendations