Dynamic service placement in geographically distributed clouds

Qi Zhang, Quanyan Zhu, Mohamed Faten Zhani, Raouf Boutaba

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

Abstract

Large-scale online service providers have been increasingly relying on geographically distributed cloud infrastructures for service hosting and delivery. In this context, a key challenge faced by service providers is to determine the locations where service applications should be placed such that the hosting cost is minimized while key performance requirements (e.g. response time) are assured. Furthermore, the dynamic nature of both demand pattern and infrastructure cost favors a dynamic solution to this problem. Currently most of the existing solutions for service placement have either ignored dynamics, or provided inadequate solutions that achieve both objectives at the same time. In this paper, we present a framework for dynamic service placement problems based on control- and game-theoretic models. In particular, we present a solution that optimizes the desired objective dynamically over time according to both demand and resource price fluctuations. We further consider the case where multiple service providers compete for resource in a dynamic manner, and show that there is a Nash equilibrium solution which is socially optimal. Using simulations based on realistic topologies, demand and resource prices, we demonstrate the effectiveness of our solution in realistic settings.

Original languageEnglish (US)
Title of host publicationProceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012
Pages526-535
Number of pages10
DOIs
StatePublished - 2012
Event32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012 - Macau, China
Duration: Jun 18 2012Jun 21 2012

Other

Other32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012
CountryChina
CityMacau
Period6/18/126/21/12

Fingerprint

Costs
Topology

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Zhang, Q., Zhu, Q., Zhani, M. F., & Boutaba, R. (2012). Dynamic service placement in geographically distributed clouds. In Proceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012 (pp. 526-535). [6258025] https://doi.org/10.1109/ICDCS.2012.74

Dynamic service placement in geographically distributed clouds. / Zhang, Qi; Zhu, Quanyan; Zhani, Mohamed Faten; Boutaba, Raouf.

Proceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012. 2012. p. 526-535 6258025.

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

Zhang, Q, Zhu, Q, Zhani, MF & Boutaba, R 2012, Dynamic service placement in geographically distributed clouds. in Proceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012., 6258025, pp. 526-535, 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012, Macau, China, 6/18/12. https://doi.org/10.1109/ICDCS.2012.74
Zhang Q, Zhu Q, Zhani MF, Boutaba R. Dynamic service placement in geographically distributed clouds. In Proceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012. 2012. p. 526-535. 6258025 https://doi.org/10.1109/ICDCS.2012.74
Zhang, Qi ; Zhu, Quanyan ; Zhani, Mohamed Faten ; Boutaba, Raouf. / Dynamic service placement in geographically distributed clouds. Proceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012. 2012. pp. 526-535
@inproceedings{0e91eaa6e6c14e90b74aedded3165e1d,
title = "Dynamic service placement in geographically distributed clouds",
abstract = "Large-scale online service providers have been increasingly relying on geographically distributed cloud infrastructures for service hosting and delivery. In this context, a key challenge faced by service providers is to determine the locations where service applications should be placed such that the hosting cost is minimized while key performance requirements (e.g. response time) are assured. Furthermore, the dynamic nature of both demand pattern and infrastructure cost favors a dynamic solution to this problem. Currently most of the existing solutions for service placement have either ignored dynamics, or provided inadequate solutions that achieve both objectives at the same time. In this paper, we present a framework for dynamic service placement problems based on control- and game-theoretic models. In particular, we present a solution that optimizes the desired objective dynamically over time according to both demand and resource price fluctuations. We further consider the case where multiple service providers compete for resource in a dynamic manner, and show that there is a Nash equilibrium solution which is socially optimal. Using simulations based on realistic topologies, demand and resource prices, we demonstrate the effectiveness of our solution in realistic settings.",
author = "Qi Zhang and Quanyan Zhu and Zhani, {Mohamed Faten} and Raouf Boutaba",
year = "2012",
doi = "10.1109/ICDCS.2012.74",
language = "English (US)",
pages = "526--535",
booktitle = "Proceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012",

}

TY - GEN

T1 - Dynamic service placement in geographically distributed clouds

AU - Zhang, Qi

AU - Zhu, Quanyan

AU - Zhani, Mohamed Faten

AU - Boutaba, Raouf

PY - 2012

Y1 - 2012

N2 - Large-scale online service providers have been increasingly relying on geographically distributed cloud infrastructures for service hosting and delivery. In this context, a key challenge faced by service providers is to determine the locations where service applications should be placed such that the hosting cost is minimized while key performance requirements (e.g. response time) are assured. Furthermore, the dynamic nature of both demand pattern and infrastructure cost favors a dynamic solution to this problem. Currently most of the existing solutions for service placement have either ignored dynamics, or provided inadequate solutions that achieve both objectives at the same time. In this paper, we present a framework for dynamic service placement problems based on control- and game-theoretic models. In particular, we present a solution that optimizes the desired objective dynamically over time according to both demand and resource price fluctuations. We further consider the case where multiple service providers compete for resource in a dynamic manner, and show that there is a Nash equilibrium solution which is socially optimal. Using simulations based on realistic topologies, demand and resource prices, we demonstrate the effectiveness of our solution in realistic settings.

AB - Large-scale online service providers have been increasingly relying on geographically distributed cloud infrastructures for service hosting and delivery. In this context, a key challenge faced by service providers is to determine the locations where service applications should be placed such that the hosting cost is minimized while key performance requirements (e.g. response time) are assured. Furthermore, the dynamic nature of both demand pattern and infrastructure cost favors a dynamic solution to this problem. Currently most of the existing solutions for service placement have either ignored dynamics, or provided inadequate solutions that achieve both objectives at the same time. In this paper, we present a framework for dynamic service placement problems based on control- and game-theoretic models. In particular, we present a solution that optimizes the desired objective dynamically over time according to both demand and resource price fluctuations. We further consider the case where multiple service providers compete for resource in a dynamic manner, and show that there is a Nash equilibrium solution which is socially optimal. Using simulations based on realistic topologies, demand and resource prices, we demonstrate the effectiveness of our solution in realistic settings.

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

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

U2 - 10.1109/ICDCS.2012.74

DO - 10.1109/ICDCS.2012.74

M3 - Conference contribution

AN - SCOPUS:84866937947

SP - 526

EP - 535

BT - Proceedings - 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012

ER -