Skip to Main content Skip to Navigation
Conference papers

Cost-efficient algorithms for critical resource allocation in cloud federations

Makhlouf Hadji 1 Benjamin Aupetit 1 Djamal Zeghlache 2, 3, 4, 5
1 IRT SystemX - IRT SystemX
2 R3S-SAMOVAR - Réseaux, Systèmes, Services, Sécurité
SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
3 RS2M - Département Réseaux et Services Multimédia Mobiles
4 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
5 CNRS - Centre National de la Recherche Scientifique
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
Keywords : Interoperability Optimization Cloud federation Cloud networking Gomory-Hu Tree
Document type :
Conference papers
Complete list of metadata
https://hal.archives-ouvertes.fr/hal-01471712
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School Connect in order to contact the contributor
Submitted on : Monday, February 20, 2017 - 11:29:32 AM
Last modification on : Monday, August 24, 2020 - 4:16:07 PM

Identifiers

Collections

INSTITUT-TELECOM | TELECOM-SUDPARIS | CNRS | UNIV-PARIS-SACLAY | IRT-SYSTEMX

Citation

Makhlouf Hadji, Benjamin Aupetit, Djamal Zeghlache. Cost-efficient algorithms for critical resource allocation in cloud federations. CLOUDNET 2016 : 5th International Conference on Cloud Networking, Oct 2016, Pisa, Italy. pp.1 - 6, ⟨10.1109/CloudNet.2016.11⟩. ⟨hal-01471712⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

194