K-medoid clustering containerized allocation algorithm for cloud computing environment

Amany AbdElSamea, Sherif M. Saif
{"title":"K-medoid clustering containerized allocation algorithm for cloud computing environment","authors":"Amany AbdElSamea, Sherif M. Saif","doi":"10.1186/s43067-024-00161-1","DOIUrl":null,"url":null,"abstract":"Load balancing is critical for container-based cloud computing environments for several reasons. A lack of appropriate load balancing techniques could result in a decrease in performance and possible service interruptions as some nodes get overloaded, while others are left underutilized. Cloud service providers can reduce latency and boost system performance by strategically placing containers using clustering algorithms. These techniques aid in efficiently using resources and load balancing by clustering related containers together according to their shared attributes. Clustering strategies are effective in allocating and controlling resources to meet the demands of a changing workload. Algorithms for clustering combine related workloads or containers into clusters, improving performance isolation and maximizing resource usage. One popular methodology for data clustering is the K-Medoid Clustering Algorithm. It is especially helpful when working with categorical data or when the dataset contains outliers. K-medoids is an unsupervised clustering approach where the core of the cluster is made up of data points known as “medoids.” A medoid is a location in the cluster whose total distance to every object in the cluster—also known as its dissimilarity—is as small as possible. Any appropriate distance function may be used, such as the Manhattan distance, the Euclidean distance, or another one. Thus, by choosing K medoids from our data sample, the K-medoids method splits the data into K clusters. This work presents the K-Medoid clustering technique for containers, which can enhance load balancing, decrease resource execution times, and increase resource utilization rates all at the same time. The results of the experiment show that the proposed method outperforms MACO and FCFS in terms of throughput by about 70% when number of cloudlets increased. The relative improvement of execution time of the proposed K-medoid algorithm w.r.t FCFS is about 50%.","PeriodicalId":100777,"journal":{"name":"Journal of Electrical Systems and Information Technology","volume":"7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Electrical Systems and Information Technology","FirstCategoryId":"0","ListUrlMain":"https://doi.org/10.1186/s43067-024-00161-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Load balancing is critical for container-based cloud computing environments for several reasons. A lack of appropriate load balancing techniques could result in a decrease in performance and possible service interruptions as some nodes get overloaded, while others are left underutilized. Cloud service providers can reduce latency and boost system performance by strategically placing containers using clustering algorithms. These techniques aid in efficiently using resources and load balancing by clustering related containers together according to their shared attributes. Clustering strategies are effective in allocating and controlling resources to meet the demands of a changing workload. Algorithms for clustering combine related workloads or containers into clusters, improving performance isolation and maximizing resource usage. One popular methodology for data clustering is the K-Medoid Clustering Algorithm. It is especially helpful when working with categorical data or when the dataset contains outliers. K-medoids is an unsupervised clustering approach where the core of the cluster is made up of data points known as “medoids.” A medoid is a location in the cluster whose total distance to every object in the cluster—also known as its dissimilarity—is as small as possible. Any appropriate distance function may be used, such as the Manhattan distance, the Euclidean distance, or another one. Thus, by choosing K medoids from our data sample, the K-medoids method splits the data into K clusters. This work presents the K-Medoid clustering technique for containers, which can enhance load balancing, decrease resource execution times, and increase resource utilization rates all at the same time. The results of the experiment show that the proposed method outperforms MACO and FCFS in terms of throughput by about 70% when number of cloudlets increased. The relative improvement of execution time of the proposed K-medoid algorithm w.r.t FCFS is about 50%.
面向云计算环境的 K-medoid 聚类容器化分配算法
出于多种原因,负载平衡对于基于容器的云计算环境至关重要。缺乏适当的负载平衡技术可能会导致性能下降和服务中断,因为一些节点会超载,而另一些节点则未得到充分利用。云服务提供商可以利用聚类算法战略性地放置容器,从而减少延迟并提高系统性能。这些技术根据相关容器的共享属性将它们聚类在一起,有助于有效利用资源和平衡负载。聚类策略可以有效地分配和控制资源,以满足不断变化的工作负载需求。聚类算法将相关的工作负载或容器组合成群集,从而提高性能隔离并最大限度地利用资源。一种常用的数据聚类方法是 K-Medoid 聚类算法。在处理分类数据或数据集包含异常值时,它尤其有用。K-medoids 是一种无监督聚类方法,聚类的核心由称为 "medoids "的数据点组成。中位点是聚类中的一个位置,它与聚类中每个对象的总距离(也称为其相似度)越小越好。可以使用任何适当的距离函数,如曼哈顿距离、欧氏距离或其他函数。因此,通过从我们的数据样本中选择 K 个中间值,K-中间值方法就能将数据分成 K 个簇。本作品提出了针对容器的 K-Medoid 聚类技术,它可以同时增强负载平衡、减少资源执行时间和提高资源利用率。实验结果表明,当小云数量增加时,所提出的方法在吞吐量方面优于 MACO 和 FCFS 约 70%。与 FCFS 相比,拟议的 K-medoid 算法的执行时间相对缩短了约 50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信