TY - GEN
T1 - A QoS-aware load balancing policy in multi-tenancy environment
AU - Sun, Hailong
AU - Zhao, Tao
AU - Tang, Yu
AU - Liu, Xudong
PY - 2014
Y1 - 2014
N2 - Cloud computing aims at providing services on the basis of a shared pool of underpinning resources and load balancing is of paramount importance in such an environment. At the same time, multi-tenancy is widely adopted in cloud computing to reduce the costs of service provisioning and to improve resource utilization. Multi-tenancy brings new challenges to load balancing, since it incurs resource competition and different QoS requirements of hosted applications. Therefore, servers with multiple deployed applications need a proper request scheduling policy to guarantee their quality of service, e.g., response time. However, most of the QoS-aware load balancing algorithms do not concern about the mutual intervention among applications deployed on the same server. When under heavy loads, mean response time of some applications may become too high to be acceptable. In this work, we propose a new load balancing algorithm, 'Server Throughput Restriction(STR)', based on M/G/s/s+r queueing model, in order to guarantee each application's mean response time and also achieve better server throughput. In addition, we conduct several experiments to analyze the performance of STR in comparison with Round-Robin and Least-Work-Remaining.
AB - Cloud computing aims at providing services on the basis of a shared pool of underpinning resources and load balancing is of paramount importance in such an environment. At the same time, multi-tenancy is widely adopted in cloud computing to reduce the costs of service provisioning and to improve resource utilization. Multi-tenancy brings new challenges to load balancing, since it incurs resource competition and different QoS requirements of hosted applications. Therefore, servers with multiple deployed applications need a proper request scheduling policy to guarantee their quality of service, e.g., response time. However, most of the QoS-aware load balancing algorithms do not concern about the mutual intervention among applications deployed on the same server. When under heavy loads, mean response time of some applications may become too high to be acceptable. In this work, we propose a new load balancing algorithm, 'Server Throughput Restriction(STR)', based on M/G/s/s+r queueing model, in order to guarantee each application's mean response time and also achieve better server throughput. In addition, we conduct several experiments to analyze the performance of STR in comparison with Round-Robin and Least-Work-Remaining.
UR - https://www.scopus.com/pages/publications/84903590768
U2 - 10.1109/SOSE.2014.21
DO - 10.1109/SOSE.2014.21
M3 - 会议稿件
AN - SCOPUS:84903590768
SN - 9781479925049
T3 - Proceedings - IEEE 8th International Symposium on Service Oriented System Engineering, SOSE 2014
SP - 140
EP - 147
BT - Proceedings - IEEE 8th International Symposium on Service Oriented System Engineering, SOSE 2014
PB - IEEE Computer Society
T2 - 8th IEEE International Symposium on Service Oriented System Engineering, SOSE 2014
Y2 - 7 April 2014 through 11 April 2014
ER -