A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers

Jalal Khamse-Ashari, Ioannis Lambadaris, George Kesidis, Bhuvan Urgaonkar, Yiqiang Zhao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538647271
DOIs
StatePublished - Jan 1 2018
Event2018 IEEE Global Communications Conference, GLOBECOM 2018 - Abu Dhabi, United Arab Emirates
Duration: Dec 9 2018Dec 13 2018

Publication series

Name2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings

Conference

Conference2018 IEEE Global Communications Conference, GLOBECOM 2018
CountryUnited Arab Emirates
CityAbu Dhabi
Period12/9/1812/13/18

Fingerprint

resource allocation
organizing
Self-organizing
Resource Allocation
Resource allocation
Servers
Server
costs
Fairness
Costs
Cost Efficiency
Data Center
Trade-offs
Numerical Experiment
Optimization Problem
resources
Resources
optimization
Allocation mechanisms
Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems and Management
  • Renewable Energy, Sustainability and the Environment
  • Safety, Risk, Reliability and Quality
  • Signal Processing
  • Modeling and Simulation
  • Instrumentation
  • Computer Networks and Communications

Cite this

Khamse-Ashari, J., Lambadaris, I., Kesidis, G., Urgaonkar, B., & Zhao, Y. (2018). A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers. In 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings [8647675] (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2018.8647675
Khamse-Ashari, Jalal ; Lambadaris, Ioannis ; Kesidis, George ; Urgaonkar, Bhuvan ; Zhao, Yiqiang. / A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers. 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2018. (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings).
@inproceedings{aea8259ec2624e4a824ef55e131bd559,
title = "A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers",
abstract = "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.",
author = "Jalal Khamse-Ashari and Ioannis Lambadaris and George Kesidis and Bhuvan Urgaonkar and Yiqiang Zhao",
year = "2018",
month = "1",
day = "1",
doi = "10.1109/GLOCOM.2018.8647675",
language = "English (US)",
series = "2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings",
address = "United States",

}

Khamse-Ashari, J, Lambadaris, I, Kesidis, G, Urgaonkar, B & Zhao, Y 2018, A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers. in 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings., 8647675, 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, Institute of Electrical and Electronics Engineers Inc., 2018 IEEE Global Communications Conference, GLOBECOM 2018, Abu Dhabi, United Arab Emirates, 12/9/18. https://doi.org/10.1109/GLOCOM.2018.8647675

A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers. / Khamse-Ashari, Jalal; Lambadaris, Ioannis; Kesidis, George; Urgaonkar, Bhuvan; Zhao, Yiqiang.

2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2018. 8647675 (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers

AU - Khamse-Ashari, Jalal

AU - Lambadaris, Ioannis

AU - Kesidis, George

AU - Urgaonkar, Bhuvan

AU - Zhao, Yiqiang

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85063462281&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063462281&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2018.8647675

DO - 10.1109/GLOCOM.2018.8647675

M3 - Conference contribution

AN - SCOPUS:85063462281

T3 - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings

BT - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Khamse-Ashari J, Lambadaris I, Kesidis G, Urgaonkar B, Zhao Y. A Cost-Efficient and Fair Multi-Resource Allocation Mechanism for Self-Organizing Servers. In 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2018. 8647675. (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings). https://doi.org/10.1109/GLOCOM.2018.8647675