A fault tolerant channel allocation scheme in distributed cloud networks
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.
KeywordsCloud 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.
- 2.Alicherry, M., Lakshman, T.V.: Network aware resource allocation in distributed clouds. In: INFOCOM, pp. 936–971 (2012)Google Scholar
- 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
- 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
- 9.Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks. Part I: protection. In: INFOCOM ’99, vol. 2, pp. 744–751 (1999)Google Scholar
- 10.Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks. Part II: restoration. In: ICC ’99, vol. 3, pp. 2023–2030 (1999)Google Scholar
- 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.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.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