Dynamic Load Balancing in Kubernetes Environments With Kubernetes Scheduling Extension (KSE)

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Pedro Moritz de Carvalho Neto, Márcio Castro, Frank Siqueira
{"title":"Dynamic Load Balancing in Kubernetes Environments With Kubernetes Scheduling Extension (KSE)","authors":"Pedro Moritz de Carvalho Neto,&nbsp;Márcio Castro,&nbsp;Frank Siqueira","doi":"10.1002/cpe.8344","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Kubernetes is a flexible and reliable container orchestrator that has been employed to maintain massive cloud infrastructures worldwide. The task of allocating “Pods” (deployable units of computing that have one or more containers) to cluster nodes in Kubernetes is done by the <span>Kube-Scheduler</span> module, which determines which nodes are valid placements for each Pod according to constraints and available resources. Since it only acts at Pod creation, it does not take any action when the load of the system becomes uneven. In imbalanced scenarios, overloaded nodes can compromise the performance and availability of services hosted by them, whereas underloaded nodes may be a waste of financial resources, especially when using public clouds. In this paper, we propose an extension to the Kubernetes scheduler, called Kubernetes Scheduling Extension (KSE), which allows users to implement dynamic load-balancing algorithms that can migrate Pods between nodes at runtime. We also provide the implementation of two well-known load-balancing algorithms (KSE-<span>GreedyLB</span> and <span>KSE-RefineLB</span>) in KSE, which can balance the load of system nodes using CPU and memory consumption metrics. We carried out several experiments to assess the effectiveness of KSE-<span>GreedyLB</span> and <span>KSE-RefineLB</span> and compared their results with <span>Kube-Scheduler</span>. Overall, we evaluated 32 different scenarios using synthetic and realistic applications. Our results showed that <span>KSE-RefineLB</span> achieves better results than <span>Kube-Scheduler</span> when the workload is highly imbalanced while keeping similar performance when the load imbalance is low.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8344","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Kubernetes is a flexible and reliable container orchestrator that has been employed to maintain massive cloud infrastructures worldwide. The task of allocating “Pods” (deployable units of computing that have one or more containers) to cluster nodes in Kubernetes is done by the Kube-Scheduler module, which determines which nodes are valid placements for each Pod according to constraints and available resources. Since it only acts at Pod creation, it does not take any action when the load of the system becomes uneven. In imbalanced scenarios, overloaded nodes can compromise the performance and availability of services hosted by them, whereas underloaded nodes may be a waste of financial resources, especially when using public clouds. In this paper, we propose an extension to the Kubernetes scheduler, called Kubernetes Scheduling Extension (KSE), which allows users to implement dynamic load-balancing algorithms that can migrate Pods between nodes at runtime. We also provide the implementation of two well-known load-balancing algorithms (KSE-GreedyLB and KSE-RefineLB) in KSE, which can balance the load of system nodes using CPU and memory consumption metrics. We carried out several experiments to assess the effectiveness of KSE-GreedyLB and KSE-RefineLB and compared their results with Kube-Scheduler. Overall, we evaluated 32 different scenarios using synthetic and realistic applications. Our results showed that KSE-RefineLB achieves better results than Kube-Scheduler when the workload is highly imbalanced while keeping similar performance when the load imbalance is low.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信