Cost-Efficient Algorithms for Critical Resource Allocation in Cloud Federations

Makhlouf Hadji, Benjamin Aupetit, Djamal Zeghlache

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Gomory-Hu based algorithms are proposed to select hosting resources and place services in a multiple providers federation context. The algorithms, use the Gomory-Hu tree, to detect critical nodes and edges in the end user requests to make selection and placement decisions. The algorithms take into account the providers' internal costs and network connectivity costs and hosting costs by the federation members. The algorithms are shown to be scalable and near-optimal through numerical simulations and evaluations.

Original languageEnglish
Title of host publicationProceedings - 2016 5th IEEE International Conference on Cloud Networking, CloudNet 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-6
Number of pages6
ISBN (Electronic)9781509050932
DOIs
Publication statusPublished - 6 Dec 2016
Externally publishedYes
Event5th IEEE International Conference on Cloud Networking, CloudNet 2016 - Pisa, Italy
Duration: 3 Oct 20166 Oct 2016

Publication series

NameProceedings - 2016 5th IEEE International Conference on Cloud Networking, CloudNet 2016

Conference

Conference5th IEEE International Conference on Cloud Networking, CloudNet 2016
Country/TerritoryItaly
CityPisa
Period3/10/166/10/16

Keywords

  • Cloud Federation
  • Cloud Networking
  • Gomory-Hu Tree
  • Interoperability
  • Optimization

Fingerprint

Dive into the research topics of 'Cost-Efficient Algorithms for Critical Resource Allocation in Cloud Federations'. Together they form a unique fingerprint.

Cite this