Resource scheduling optimisation algorithm for containerised microservice architecture in cloud computing
by Peng Li; Jinquan Song; He Xu; Lu Dong; Yang Zhou
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 8, No. 1/2, 2018

Abstract: Currently, the containerised microservice architecture has aroused great concern. The single application is developed as a suite of small services to facilitate the application deployment, expansion and management. The traditional scheduling of microservice tends to focus on the load balancing of cluster, ignoring the quality of service (QoS). Therefore, this paper proposes a prediction model of component relevance, by adopting the optimised artificial bee colony algorithm (OABC) on the containerised microservice scheduling. Different assessment strategies are adopted according to the differences in the correlation among components. Two-point crossover operator is introduced to improve the exploration ability of the algorithm. The mutation operator is added to enhance the local search ability, and the mutation probability is set to the dynamic value which varies with the number of iterations to speed up the convergence of the algorithm. The experimental results show that the OABC is preferable to the artificial bee colony algorithm (ABC) and the greedy algorithm as to the cluster load balancing and service response time aspects.

Online publication date: Fri, 17-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email