Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Electricity Price-aware Consolidation Algorithms for Time-sensitive VM Services in Cloud Systems
School of Computer Science, Southeast University, Nanjing, Jiangsu, China.
School of Computer Science and Engeering, Southeast University, Nanjing, Jiangsu China.
Computer Science and Engineering, Harbin Institute of Technology, Harbin, Heilongjiang China.
School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu China.
Show others and affiliations
2021 (English)In: IEEE Transactions on Services Computing, E-ISSN 1939-1374, Vol. 14, no 6, p. 1726-1738Article in journal (Refereed) Published
Abstract [en]

Despite the salient feature of cloud computing, the cloud provider still suffers from electricity bill, which mainly comes from 1) the power consumption of running physical machines and 2) the dynamically varying electricity price offered by smart grids. In the literature, there exist viable solutions adaptive to electricity price variation to reduce the electricity bill. However, they are not applicable to serving time-sensitive VM requests. In serving time-sensitive VM requests, it is potential for the cloud provider to apply proper consolidation strategies to further reduce the electricity bill. In this work, to address this challenge, we develop electricity-price-aware consolidation algorithms for both the offline and online scenarios. For the offline scenario, we first develop an consolidation algorithm with constant approximation, which always approaches the optimal solution within a constant factor of 5. For the online scenario, we propose an $O(\log(\frac{L_{max}}{L_{min}}))$ -competitive algorithm that is able to approach the optimal offline solution within a logarithmic factor, where $\frac{L_{max}}{L_{min}}$ is the ratio of the longest length of the processing time requirement of VMs to the shortest one. Our trace-driven simulation results further demonstrate that the average performance of the proposed algorithms produce near-optimal electricity bill.

Place, publisher, year, edition, pages
IEEE, 2021. Vol. 14, no 6, p. 1726-1738
Keywords [en]
Cloud computing, Approximation algorithms, Data centers, Resource management, Quality of service, Power demand, Virtual machining
National Category
Computer and Information Sciences
Research subject
Pervasive Mobile Computing
Identifiers
URN: urn:nbn:se:ltu:diva-73551DOI: 10.1109/TSC.2019.2894742ISI: 000728144600011Scopus ID: 2-s2.0-85121709511OAI: oai:DiVA.org:ltu-73551DiVA, id: diva2:1303724
Note

Validerad;2022;Nivå 2;2022-01-01 (johcin)

Available from: 2019-04-10 Created: 2019-04-10 Last updated: 2025-02-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Vasilakos, Athanasios

Search in DiVA

By author/editor
Vasilakos, Athanasios
By organisation
Computer Science
In the same journal
IEEE Transactions on Services Computing
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 103 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf