Suboptimal mechanism for load balancing in cloud environment

Shikha Pandey, A. Upadhaya, C. K. Jha
{"title":"Suboptimal mechanism for load balancing in cloud environment","authors":"Shikha Pandey, A. Upadhaya, C. K. Jha","doi":"10.1109/ICAMMAET.2017.8186689","DOIUrl":null,"url":null,"abstract":"Load balancing is important and major issue for cloud networks due to its elastic nature, user's unpredictable behavior and difficulty faced to foresee the request issued to the server. In order to efficiently utilize cloud resources, we are presenting a new methodology for dynamic resource allocation based on the suboptimal mechanism of aggregation i.e. GIT (greedy incremental tree). The technique improves path sharing at time of migration during load balance process. A cloud workload network is constructed based on-Greedy heuristics having the characteristics to build incrementally diverse set, selecting one compute node at a time to maximize diversity measure. The virtual machine manager can rely on the rules and can make efficient decision for optimal provisioning of virtual machine based on the aggregated route.","PeriodicalId":425974,"journal":{"name":"2017 International Conference on Algorithms, Methodology, Models and Applications in Emerging Technologies (ICAMMAET)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Algorithms, Methodology, Models and Applications in Emerging Technologies (ICAMMAET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAMMAET.2017.8186689","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Load balancing is important and major issue for cloud networks due to its elastic nature, user's unpredictable behavior and difficulty faced to foresee the request issued to the server. In order to efficiently utilize cloud resources, we are presenting a new methodology for dynamic resource allocation based on the suboptimal mechanism of aggregation i.e. GIT (greedy incremental tree). The technique improves path sharing at time of migration during load balance process. A cloud workload network is constructed based on-Greedy heuristics having the characteristics to build incrementally diverse set, selecting one compute node at a time to maximize diversity measure. The virtual machine manager can rely on the rules and can make efficient decision for optimal provisioning of virtual machine based on the aggregated route.
云环境下负载平衡的次优机制
由于云网络的弹性、用户不可预测的行为和难以预见向服务器发出的请求,负载平衡是云网络的重要和主要问题。为了有效地利用云资源,我们提出了一种基于次优聚合机制的动态资源分配新方法,即GIT(贪心增量树)。该技术改善了负载均衡过程中迁移时的路径共享。基于贪心启发式算法构建云工作负载网络,该算法具有构建增量多样化集的特点,每次选择一个计算节点以最大化多样性度量。虚拟机管理器可以依赖这些规则,并根据聚合路由对虚拟机的最优配置做出有效决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信