Cost-efficient algorithms for critical resource allocation in cloud federations

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
Type de document :
Communication dans un congrès
CLOUDNET 2016 : 5th International Conference on Cloud Networking, Oct 2016, Pisa, Italy. IEEE Computer Society, Proceedings CLOUDNET 2016 : 5th International Conference on Cloud Networking, pp.1 - 6, 2016, 〈10.1109/CloudNet.2016.11〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01471712
Contributeur : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Soumis le : lundi 20 février 2017 - 11:29:32
Dernière modification le : jeudi 11 janvier 2018 - 06:27:35

Identifiants

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. IEEE Computer Society, Proceedings CLOUDNET 2016 : 5th International Conference on Cloud Networking, pp.1 - 6, 2016, 〈10.1109/CloudNet.2016.11〉. 〈hal-01471712〉

Partager

Métriques

Consultations de la notice

213