TY - GEN
T1 - Load Balancing for Interdependent IoT Microservices
AU - Yu, Ruozhou
AU - Kilari, Vishnu Teja
AU - Xue, Guoliang
AU - Yang, Dejun
N1 - Funding Information:
This research was supported in part by NSF grants 1717197, 1704092, 1461886, and 1717315.
Funding Information:
Yu, Kilari and Xue ({ruozhouy, vkilari, xue}@asu.edu) are all with Arizona State University, Tempe, AZ 85287. Yang (djyang@mines.edu) is with Colorado School of Mines, Golden, CO 80401. This research was supported in part by NSF grants 1717197, 1704092, 1461886, and 1717315.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/4
Y1 - 2019/4
N2 - Advances in virtualization technologies and edge computing have inspired a new paradigm for Internet-of-Things (IoT) application development. By breaking a monolithic application into loosely coupled microservices, great gain can be achieved in performance, flexibility and robustness. In this paper, we study the important problem of load balancing across IoT microservice instances. A key difficulty in this problem is the interdependencies among microservices: the load on a successor microservice instance directly depends on the load distributed from its predecessor microservice instances. We propose a graph-based model for describing the load dependencies among microservices. Based on the model, we first propose a basic formulation for load balancing, which can be solved optimally in polynomial time. The basic model neglects the quality-of-service (QoS) of the IoT application. We then propose a QoS-aware load balancing model, based on a novel abstraction that captures a realization of the application's internal logic. The QoS-aware load balancing problem is NP-hard. We propose a fully polynomial-time approximation scheme for the QoS-aware problem. We show through simulation experiments that our proposed algorithm achieves enhanced QoS compared to heuristic solutions.
AB - Advances in virtualization technologies and edge computing have inspired a new paradigm for Internet-of-Things (IoT) application development. By breaking a monolithic application into loosely coupled microservices, great gain can be achieved in performance, flexibility and robustness. In this paper, we study the important problem of load balancing across IoT microservice instances. A key difficulty in this problem is the interdependencies among microservices: the load on a successor microservice instance directly depends on the load distributed from its predecessor microservice instances. We propose a graph-based model for describing the load dependencies among microservices. Based on the model, we first propose a basic formulation for load balancing, which can be solved optimally in polynomial time. The basic model neglects the quality-of-service (QoS) of the IoT application. We then propose a QoS-aware load balancing model, based on a novel abstraction that captures a realization of the application's internal logic. The QoS-aware load balancing problem is NP-hard. We propose a fully polynomial-time approximation scheme for the QoS-aware problem. We show through simulation experiments that our proposed algorithm achieves enhanced QoS compared to heuristic solutions.
KW - IoT
KW - application graph
KW - fully polynomial-time approximation scheme
KW - load balancing
KW - microservice
UR - http://www.scopus.com/inward/record.url?scp=85068225941&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85068225941&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2019.8737450
DO - 10.1109/INFOCOM.2019.8737450
M3 - Conference contribution
AN - SCOPUS:85068225941
T3 - Proceedings - IEEE INFOCOM
SP - 298
EP - 306
BT - INFOCOM 2019 - IEEE Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Conference on Computer Communications, INFOCOM 2019
Y2 - 29 April 2019 through 2 May 2019
ER -