Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers

Ruozhou Yu, Guoliang Xue, Xiang Zhang, Dan Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Cloud computing has emerged as a powerful and elastic platform for internet service hosting, yet it also draws concerns of the unpredictable performance of cloud-based services due to network congestion. To offer predictable performance, the virtual cluster abstraction of cloud services has been proposed, which enables allocation and performance isolation regarding both computing resources and network bandwidth in a simplified virtual network model. One issue arisen in virtual cluster allocation is the survivability of tenant services against physical failures. Existing works have studied virtual cluster backup provisioning with fixed primary embeddings, but have not considered the impact of primary embeddings on backup resource consumption. To address this issue, in this paper we study how to embed virtual clusters survivably in the cloud data center, by jointly optimizing primary and backup embeddings of the virtual clusters. We formally define the survivable virtual cluster embedding problem. We then propose a novel algorithm, which computes the most resource-efficient embedding given a tenant request. Since the optimal algorithm has high time complexity, we further propose a faster heuristic algorithm, which is several orders faster than the optimal solution, yet able to achieve similar performance. Besides theoretical analysis, we evaluate our algorithms via extensive simulations.

Original languageEnglish (US)
Title of host publicationINFOCOM 2017 - IEEE Conference on Computer Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509053360
DOIs
StatePublished - Oct 2 2017
Event2017 IEEE Conference on Computer Communications, INFOCOM 2017 - Atlanta, United States
Duration: May 1 2017May 4 2017

Other

Other2017 IEEE Conference on Computer Communications, INFOCOM 2017
CountryUnited States
CityAtlanta
Period5/1/175/4/17

Fingerprint

Bandwidth
Heuristic algorithms
Cloud computing
Internet

Keywords

  • Bandwidth guarantee
  • Survivability
  • Virtual cluster

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Yu, R., Xue, G., Zhang, X., & Li, D. (2017). Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers. In INFOCOM 2017 - IEEE Conference on Computer Communications [8056945] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2017.8056945

Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers. / Yu, Ruozhou; Xue, Guoliang; Zhang, Xiang; Li, Dan.

INFOCOM 2017 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2017. 8056945.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, R, Xue, G, Zhang, X & Li, D 2017, Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers. in INFOCOM 2017 - IEEE Conference on Computer Communications., 8056945, Institute of Electrical and Electronics Engineers Inc., 2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, United States, 5/1/17. https://doi.org/10.1109/INFOCOM.2017.8056945
Yu R, Xue G, Zhang X, Li D. Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers. In INFOCOM 2017 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc. 2017. 8056945 https://doi.org/10.1109/INFOCOM.2017.8056945
Yu, Ruozhou ; Xue, Guoliang ; Zhang, Xiang ; Li, Dan. / Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers. INFOCOM 2017 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{6074ea8023a2463ea229e1c537bca0e0,
title = "Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers",
abstract = "Cloud computing has emerged as a powerful and elastic platform for internet service hosting, yet it also draws concerns of the unpredictable performance of cloud-based services due to network congestion. To offer predictable performance, the virtual cluster abstraction of cloud services has been proposed, which enables allocation and performance isolation regarding both computing resources and network bandwidth in a simplified virtual network model. One issue arisen in virtual cluster allocation is the survivability of tenant services against physical failures. Existing works have studied virtual cluster backup provisioning with fixed primary embeddings, but have not considered the impact of primary embeddings on backup resource consumption. To address this issue, in this paper we study how to embed virtual clusters survivably in the cloud data center, by jointly optimizing primary and backup embeddings of the virtual clusters. We formally define the survivable virtual cluster embedding problem. We then propose a novel algorithm, which computes the most resource-efficient embedding given a tenant request. Since the optimal algorithm has high time complexity, we further propose a faster heuristic algorithm, which is several orders faster than the optimal solution, yet able to achieve similar performance. Besides theoretical analysis, we evaluate our algorithms via extensive simulations.",
keywords = "Bandwidth guarantee, Survivability, Virtual cluster",
author = "Ruozhou Yu and Guoliang Xue and Xiang Zhang and Dan Li",
year = "2017",
month = "10",
day = "2",
doi = "10.1109/INFOCOM.2017.8056945",
language = "English (US)",
booktitle = "INFOCOM 2017 - IEEE Conference on Computer Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers

AU - Yu, Ruozhou

AU - Xue, Guoliang

AU - Zhang, Xiang

AU - Li, Dan

PY - 2017/10/2

Y1 - 2017/10/2

N2 - Cloud computing has emerged as a powerful and elastic platform for internet service hosting, yet it also draws concerns of the unpredictable performance of cloud-based services due to network congestion. To offer predictable performance, the virtual cluster abstraction of cloud services has been proposed, which enables allocation and performance isolation regarding both computing resources and network bandwidth in a simplified virtual network model. One issue arisen in virtual cluster allocation is the survivability of tenant services against physical failures. Existing works have studied virtual cluster backup provisioning with fixed primary embeddings, but have not considered the impact of primary embeddings on backup resource consumption. To address this issue, in this paper we study how to embed virtual clusters survivably in the cloud data center, by jointly optimizing primary and backup embeddings of the virtual clusters. We formally define the survivable virtual cluster embedding problem. We then propose a novel algorithm, which computes the most resource-efficient embedding given a tenant request. Since the optimal algorithm has high time complexity, we further propose a faster heuristic algorithm, which is several orders faster than the optimal solution, yet able to achieve similar performance. Besides theoretical analysis, we evaluate our algorithms via extensive simulations.

AB - Cloud computing has emerged as a powerful and elastic platform for internet service hosting, yet it also draws concerns of the unpredictable performance of cloud-based services due to network congestion. To offer predictable performance, the virtual cluster abstraction of cloud services has been proposed, which enables allocation and performance isolation regarding both computing resources and network bandwidth in a simplified virtual network model. One issue arisen in virtual cluster allocation is the survivability of tenant services against physical failures. Existing works have studied virtual cluster backup provisioning with fixed primary embeddings, but have not considered the impact of primary embeddings on backup resource consumption. To address this issue, in this paper we study how to embed virtual clusters survivably in the cloud data center, by jointly optimizing primary and backup embeddings of the virtual clusters. We formally define the survivable virtual cluster embedding problem. We then propose a novel algorithm, which computes the most resource-efficient embedding given a tenant request. Since the optimal algorithm has high time complexity, we further propose a faster heuristic algorithm, which is several orders faster than the optimal solution, yet able to achieve similar performance. Besides theoretical analysis, we evaluate our algorithms via extensive simulations.

KW - Bandwidth guarantee

KW - Survivability

KW - Virtual cluster

UR - http://www.scopus.com/inward/record.url?scp=85034041000&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034041000&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2017.8056945

DO - 10.1109/INFOCOM.2017.8056945

M3 - Conference contribution

AN - SCOPUS:85034041000

BT - INFOCOM 2017 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -