云计算中加入空闲队列算法中的Dispatcher I-queue优化

Sudha Narang
{"title":"云计算中加入空闲队列算法中的Dispatcher I-queue优化","authors":"Sudha Narang","doi":"10.22201/icat.24486736e.2023.21.2.1621","DOIUrl":null,"url":null,"abstract":"Objectives: Modern data centers serving web and mobile applications employ distributed load balancers. The Join Idle Queue (JIQ) algorithm is ideally suited for load balancing in a distributed setup. It attains fast response time by directing service requests to idle servers which can immediately process them. However, JIQ is not optimal in tracking idle servers leaving room for improvement. \nMethods: We observed that JIQ assigns idle servers non-uniformly to load balancers leaving some load balancers with no access to idle servers. We propose a variant of the JIQ algorithm, Join Idle Queue Dispatcher I-queue Optimization (JIQ-DIO), which increases the probability of load balancers having access to idle servers without additional communication overhead leading to improved response time. \nFindings: We simulated JIQ-DIO on CloudSim Plus 3.0 and compared it with standard JIQ and its different variants. JIQ-DIO was found to increase the probability of incoming requests being directed to idle servers and lead to more than two-fold improvement in response time across a broad range of parameters.","PeriodicalId":15073,"journal":{"name":"Journal of Applied Research and Technology","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dispatcher I-queue Optimization in Join Idle Queue Algorithm for Improved Load Balancing in Cloud Computing\",\"authors\":\"Sudha Narang\",\"doi\":\"10.22201/icat.24486736e.2023.21.2.1621\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Objectives: Modern data centers serving web and mobile applications employ distributed load balancers. The Join Idle Queue (JIQ) algorithm is ideally suited for load balancing in a distributed setup. It attains fast response time by directing service requests to idle servers which can immediately process them. However, JIQ is not optimal in tracking idle servers leaving room for improvement. \\nMethods: We observed that JIQ assigns idle servers non-uniformly to load balancers leaving some load balancers with no access to idle servers. We propose a variant of the JIQ algorithm, Join Idle Queue Dispatcher I-queue Optimization (JIQ-DIO), which increases the probability of load balancers having access to idle servers without additional communication overhead leading to improved response time. \\nFindings: We simulated JIQ-DIO on CloudSim Plus 3.0 and compared it with standard JIQ and its different variants. JIQ-DIO was found to increase the probability of incoming requests being directed to idle servers and lead to more than two-fold improvement in response time across a broad range of parameters.\",\"PeriodicalId\":15073,\"journal\":{\"name\":\"Journal of Applied Research and Technology\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Research and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22201/icat.24486736e.2023.21.2.1621\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Research and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22201/icat.24486736e.2023.21.2.1621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

目标:服务于web和移动应用程序的现代数据中心采用分布式负载平衡器。Join Idle Queue (JIQ)算法非常适合分布式设置中的负载平衡。它通过将服务请求定向到可以立即处理它们的空闲服务器来获得快速响应时间。但是,JIQ在跟踪空闲服务器方面并不是最优的,这给改进留下了空间。方法:我们观察到JIQ不均匀地将空闲服务器分配给负载平衡器,使一些负载平衡器无法访问空闲服务器。我们提出了JIQ算法的一种变体,Join Idle Queue Dispatcher I-queue Optimization (JIQ- dio),它增加了负载平衡器访问空闲服务器的概率,而没有额外的通信开销,从而改善了响应时间。结果:我们在CloudSim Plus 3.0上模拟JIQ- dio,并将其与标准JIQ及其不同变体进行比较。发现JIQ-DIO增加了传入请求被定向到空闲服务器的可能性,并在广泛的参数范围内将响应时间提高了两倍以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dispatcher I-queue Optimization in Join Idle Queue Algorithm for Improved Load Balancing in Cloud Computing
Objectives: Modern data centers serving web and mobile applications employ distributed load balancers. The Join Idle Queue (JIQ) algorithm is ideally suited for load balancing in a distributed setup. It attains fast response time by directing service requests to idle servers which can immediately process them. However, JIQ is not optimal in tracking idle servers leaving room for improvement. Methods: We observed that JIQ assigns idle servers non-uniformly to load balancers leaving some load balancers with no access to idle servers. We propose a variant of the JIQ algorithm, Join Idle Queue Dispatcher I-queue Optimization (JIQ-DIO), which increases the probability of load balancers having access to idle servers without additional communication overhead leading to improved response time. Findings: We simulated JIQ-DIO on CloudSim Plus 3.0 and compared it with standard JIQ and its different variants. JIQ-DIO was found to increase the probability of incoming requests being directed to idle servers and lead to more than two-fold improvement in response time across a broad range of parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Applied Research and Technology
Journal of Applied Research and Technology 工程技术-工程:电子与电气
CiteScore
1.50
自引率
0.00%
发文量
0
审稿时长
6-12 weeks
期刊介绍: The Journal of Applied Research and Technology (JART) is a bimonthly open access journal that publishes papers on innovative applications, development of new technologies and efficient solutions in engineering, computing and scientific research. JART publishes manuscripts describing original research, with significant results based on experimental, theoretical and numerical work. The journal does not charge for submission, processing, publication of manuscripts or for color reproduction of photographs. JART classifies research into the following main fields: -Material Science: Biomaterials, carbon, ceramics, composite, metals, polymers, thin films, functional materials and semiconductors. -Computer Science: Computer graphics and visualization, programming, human-computer interaction, neural networks, image processing and software engineering. -Industrial Engineering: Operations research, systems engineering, management science, complex systems and cybernetics applications and information technologies -Electronic Engineering: Solid-state physics, radio engineering, telecommunications, control systems, signal processing, power electronics, electronic devices and circuits and automation. -Instrumentation engineering and science: Measurement devices (pressure, temperature, flow, voltage, frequency etc.), precision engineering, medical devices, instrumentation for education (devices and software), sensor technology, mechatronics and robotics.
期刊最新文献
Use of recycled concrete and rice husk ash for concrete: A review Health assessment of welding by-products in a linear welding automation: Temperature and smoke concentration measurements matlab based graphical user interface for the monitoring and early detection of keratoconus Identification of geothermal potential zone associated with land surface temperature derived from Landsat 8 data using split-window algorithm Effect of microcarbon particle size and dispersion on the electrical conductivity of LLDPE-carbon composite
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1