A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers
In this paper, we study cost-efficient and fair allocation of multiple types of resources in an environment of heterogeneous and self-organizing servers. To address this problem, we formulate an optimization problem which aims at minimizing the operational costs for all servers, while providing fairness across different users. We propose a fully distributed implementation to solve this problem. The proposed mechanism is shown to achieve envy-freeness among different users. Furthermore, we show how it captures the trade-off between cost-efficiency and fairness. We employ numerical experiments to show the effectiveness of our proposed mechanism in reducing operational costs for a geo-distributed data-center.
|2018 IEEE Global Communications Conference, GLOBECOM 2018|
|Organisation||School of Mathematics and Statistics|
Khamse-Ashari, J. (Jalal), Lambadaris, I. (Ioannis), Kesidis, G. (George), Urgaonkar, B. (Bhuvan), & Zhao, Y. (2019). A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers. In 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. doi:10.1109/GLOCOM.2018.8647675