Time Complexity of an Distributed Algorithm for Load Balancing of Microservice-oriented Applications in the Cloud

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

Full description

Saved in:
Bibliographic Details
Published in:ITM Web of Conferences 2018, Vol.21, p.18
Main Authors: Rusek, Marian, Landmesser, Joanna
Format: Article
Language:English
Subjects:
Algorithms
Cloud computing
Complexity
Containers
Load balancing
Stress concentration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2271-2097
2431-7578
2271-2097
DOI:10.1051/itmconf/20182100018