Cost-Efficient Algorithms for Critical Resource Allocation in Cloud Federations

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.

[1]  David Bermbach,et al.  Cloud Federation: Effects of Federated Compute Resources on Quality of Service and Cost* , 2013, 2013 IEEE International Conference on Cloud Engineering (IC2E).

[2]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[3]  Tommaso Cucinotta,et al.  Elastic Admission Control for Federated Cloud Services , 2014, IEEE Transactions on Cloud Computing.

[4]  Xavier Hesselbach,et al.  Virtual Network Embedding: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[5]  Daniel Grosu,et al.  Cloud Federations in the Sky: Formation Game and Mechanism , 2015, IEEE Transactions on Cloud Computing.

[6]  Mon-Yen Luo,et al.  Towards Network Virtualization Management for Federated Cloud Systems , 2013, 2013 IEEE Sixth International Conference on Cloud Computing.

[7]  Djamal Zeghlache,et al.  Improving profit through cloud federation , 2015, 2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC).

[8]  Blazej Pietrzak,et al.  Networking solutions in the federation of clouds , 2013, Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013).

[9]  Nancy Samaan,et al.  A Novel Economic Sharing Model in a Federation of Selfish Cloud Providers , 2014, IEEE Transactions on Parallel and Distributed Systems.