ITM Web Conf.
Volume 21, 2018Computing in Science and Technology (CST 2018)
|Number of page(s)||8|
|Published online||12 October 2018|
Time Complexity of an Distributed Algorithm for Load Balancing of Microservice-oriented Applications in the Cloud
Warsaw University of Life Sciences – SGGW, Nowoursynowska 159, 02-776 Warsaw, Poland
* Corresponding author: email@example.com
Microservice architecture is a relatively new cloud application design pattern. Each microservice has a single responsibility in terms of functional requirement, and that can be managed independently from other microservices. This is done using automated cloud orchestration systems. In this paper we analyze the time complexity of an simple swarm-like decentralized load balancing algorithm for microservices running inside OpenVZ virtualization containers. We show that it can offer performance improvements with respect to the existing centralized container orchestration systems.
© The Authors, published by EDP Sciences, 2018
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.