Cluster Computing

, Volume 18, Issue 4, pp 1423–1433 | Cite as

A fault tolerant channel allocation scheme in distributed cloud networks

  • Jae-Il Cho
  • Kiheon Park
  • TaeYeon Kim
  • Hongseok Jeon
  • Wonhyuk Lee
  • Hyuncheol Kim


With the cloud computing, storage and computing resources are moving to remote resources such as virtual servers and storage systems in large datacenters, which raise many performance and management challenges. The distributed cloud networks must have an ability to maintain an acceptable level of service during network failures to provide high resilience against service failures. This paper presents an eccentric fault tolerant path grouping scheme that can achieve mobility independent Quality of Service guaranteed services in distributed cloud networks To make this possible, we propose a path allocation and restoration strategy called “Reverse Shared Risk Link Group” and demonstrates how this concept can be applied to minimize recovery contention in cloud networks and to assess the network convergence associated with failures. To reflect little more actual situations, we assume that the bandwidth of cloud connection requests can be some fraction of the lightpath capacity. Simulation results show that the proposed recovery scheme outperforms other schemes with fewer signaling traffics and contention probability. Very fast restorability can be accomplished for multiple failures. We also has developed an analytical model and performed analysis for the proposed scheme in terms of two performance factors: mean system time and reservation blocking probability.


Cloud networks Micro datacenter Reverse Shared Risk Link Group Recovery contention Fast restoration 



This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIP) (B0101-15-233, Smart Networking Core Technology Development). We would also like to thank the reviewers for their valuable comments, questions, and suggestions.


  1. 1.
    Banikazemi, M., Olshefski, D., Shaikh, A., Tracey, J., Guohui, Wang: Meridian: an SDN platform for cloud network services. IEEE Commun. Mag. 51(2), 120–127 (2013)CrossRefGoogle Scholar
  2. 2.
    Alicherry, M., Lakshman, T.V.: Network aware resource allocation in distributed clouds. In: INFOCOM, pp. 936–971 (2012)Google Scholar
  3. 3.
    Luo, M.-Y., Chen, J.-Y.: Software defined networking across distributed datacenters over cloud, In: International Conference on Cloud Computing Technology and Science, pp. 615–622 (2013)Google Scholar
  4. 4.
    Bari, M.F., Boutaba, R., Esteves, R., Granville, L.Z., Podlesny, M., Rabbani, M.G., Qi, Z., Zhani, M.F.: Data center network virtualization: a survey. IEEE Commun. Surv. Tutor. 15, 909–928 (2013)CrossRefGoogle Scholar
  5. 5.
    Wang, J., Sahasrabuddhe, L., Mukherjee, B.: Path vs. subpath vs. link restoration for fault management in IP over WDM networks: performance comparisons using GMPLS control signaling. IEEE Commun. Mag. 11, 80–86 (2002)Google Scholar
  6. 6.
    Secci, S., Sans, B.: Survivability and reliability of a composite-star transport network with disconnected core switches. Telecommun. Syst. 46(1), 43–59 (2011)CrossRefGoogle Scholar
  7. 7.
    Mas, C., Thiran, P.: An efficient algorithm for locating soft and hard failures in WDM networks. IEEE J. Sel. Areas Commun. 18(10), 1900–1910 (2000)CrossRefGoogle Scholar
  8. 8.
    Ferreira, A., Prennes, S., Rivano, H., Richa, A.W., Stier Moses, N.: Models, complexity and algorithms for the design of multi-fiber WDM networks. Telecommun. Syst. 24(2), 123–138 (2003)CrossRefGoogle Scholar
  9. 9.
    Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks. Part I: protection. In: INFOCOM ’99, vol. 2, pp. 744–751 (1999)Google Scholar
  10. 10.
    Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks. Part II: restoration. In: ICC ’99, vol. 3, pp. 2023–2030 (1999)Google Scholar
  11. 11.
    Zhu, K., Mukherjee, B.: Traffic grooming in an optical WDM mesh network. IEEE J. Sel. Areas Commun. 20(1), 122–133 (2002)CrossRefGoogle Scholar
  12. 12.
    Prathombutr, P., Stach, J., Park, E.K.: An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives. Telecommun. Syst. 28(3–4), 369–386 (2005)CrossRefGoogle Scholar
  13. 13.
    Jianxin, W., Weiping, W., Jianer, C., Songqiao, C.: A randomized Qos routing algorithm on networks with inaccurate link-state information. In: GLOBECOM ’99, vol. 3, pp. 1694–1698 (1999)Google Scholar
  14. 14.
    Gomes, T., Simes, C., Fernandes, L.: Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommun. Syst. (2011) (Online First)Google Scholar
  15. 15.
    Kim, H., Choi, J., Ahn, S., Chung, J.: Analysis of end to end recovery algorithms with preemptive priority in GMPLS networks. In: LNCS 2662, pp. 118–127 (2003)Google Scholar
  16. 16.
    Kar, K., Kodialam, M., Lakshman, T.V.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE J. Sel. Areas Commun. 18(12), 2566–2579 (2000)CrossRefGoogle Scholar
  17. 17.
    Neuts, M.F.: Matrix-geomatric solutions in stochastic models. Bull. Am. Math. Soc. 8, 81–100 (1983)CrossRefGoogle Scholar
  18. 18.
    Kim, Y.H., Un, C.K.: Dynamic sub-path protection for multi-granularity traffic in WDM mesh networks. IEEE Trans. Commun. 41, 771–781 (1993)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Jae-Il Cho
    • 1
  • Kiheon Park
    • 5
  • TaeYeon Kim
    • 2
  • Hongseok Jeon
    • 2
  • Wonhyuk Lee
    • 3
  • Hyuncheol Kim
    • 4
  1. 1.Electronics and Telecommunications Research Institute (ETRI)Daejeon, 305-700 Sungkyunkwan UniversitySuwonKorea
  2. 2.Electronics and Telecommunications Research InstituteDaejeonKorea
  3. 3.Korea Institute of Science & Technology InformationDaejeonKorea
  4. 4.Department of Computer ScienceNamseoul UniversityCheonanKorea
  5. 5.College of Information and Communication EngineeringSungkyunkwan UniversitySuwonKorea

Personalised recommendations