2023
DOI: 10.1109/access.2023.3313643
|View full text |Cite
|
Sign up to set email alerts
|

K-TAHP: A Kubernetes Load Balancing Strategy Base on TOPSIS+AHP

Rong Gao,
Xiaolan Xie,
Qiang Guo

Abstract: Kubernetes is an orchestration platform designed for containerized applications,allows the application provider to scale automatically to match the flfluctuating intensity of processing demand. Container cluster technology is used to encapsulate, isolate, and deploy applications, addressing the issue of low system reliability due to interlocking failures.However, after running for a long time, Kubernetes clusters often suffer from uneven system load, leading to a performance decline. To address this issue, a l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…While PSO-based models have demonstrated effectiveness in optimizing task allocation and reducing makespan, they often fall short in handling the dynamic nature of cloud workloads. Moreover, these models may not adequately address the balance between load distribution and energy consumption levels [16,17,18]. Another noteworthy scheduling model is the Simulated Annealing (SA) based scheduling model.…”
Section: Literature Surveymentioning
confidence: 99%
See 1 more Smart Citation
“…While PSO-based models have demonstrated effectiveness in optimizing task allocation and reducing makespan, they often fall short in handling the dynamic nature of cloud workloads. Moreover, these models may not adequately address the balance between load distribution and energy consumption levels [16,17,18]. Another noteworthy scheduling model is the Simulated Annealing (SA) based scheduling model.…”
Section: Literature Surveymentioning
confidence: 99%
“…While, the hidden state is updated via Eq. 16. β„Žπ‘‘ = π‘œπ‘‘ * π‘‘π‘Žπ‘›β„Ž(𝑐𝑑) (16) This process is repeated for reverse mappings between VMs & tasks, in order to obtain backward hidden states. 𝐡oth these states are fused via Eq.…”
Section: π‘œπ‘” = 𝜎(π‘Šπ‘œ * [β„Ž(𝑑 βˆ’ 1) 𝑐𝑑] + π‘π‘œ) (15)mentioning
confidence: 99%