微服务动态高可用负载均衡算法的研究与改进

Jianting Li, Guohong Yi, Bingqian Wu, Zhicao Cao, Xiaodong Xu
{"title":"微服务动态高可用负载均衡算法的研究与改进","authors":"Jianting Li, Guohong Yi, Bingqian Wu, Zhicao Cao, Xiaodong Xu","doi":"10.1109/AICIT55386.2022.9930161","DOIUrl":null,"url":null,"abstract":"In microservices, in order to maintain the efficiency and reliability of the system under high concurrency and to solve the problem that the load balancer polling method in microservices cannot adapt to the high concurrency and high load situation, an algorithm DWLOAD (Dynamic Weight Loading Algorithm) is proposed for the dynamic weight server based on virtual nodes in conjunction with the actual application scenario. The algorithm introduces the concepts of virtual nodes and real-time weights based on a smooth polling load algorithm. The DWLOAD algorithm calculates the number of recent requests, response time, and throughput of the same microservice module deployed in different servers to obtain the real-time weights of each server and records them in the weights table, and uses the smooth polling loading algorithm to initialize virtual nodes in batches. The virtual nodes are initialized in batches using a smooth polling load algorithm. Through simulation experiments, the QPS processing capability of DWLOAD is improved by about 50% compared with the smooth polling algorithm in large-scale scenarios, which effectively improves the efficiency and reliability of load balancing in high-load situations in microservices and reduces the comprehensive response time of the system.","PeriodicalId":231070,"journal":{"name":"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Research and Improvement of Dynamic Highly Available Load Balancing Algorithm for Microservices\",\"authors\":\"Jianting Li, Guohong Yi, Bingqian Wu, Zhicao Cao, Xiaodong Xu\",\"doi\":\"10.1109/AICIT55386.2022.9930161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In microservices, in order to maintain the efficiency and reliability of the system under high concurrency and to solve the problem that the load balancer polling method in microservices cannot adapt to the high concurrency and high load situation, an algorithm DWLOAD (Dynamic Weight Loading Algorithm) is proposed for the dynamic weight server based on virtual nodes in conjunction with the actual application scenario. The algorithm introduces the concepts of virtual nodes and real-time weights based on a smooth polling load algorithm. The DWLOAD algorithm calculates the number of recent requests, response time, and throughput of the same microservice module deployed in different servers to obtain the real-time weights of each server and records them in the weights table, and uses the smooth polling loading algorithm to initialize virtual nodes in batches. The virtual nodes are initialized in batches using a smooth polling load algorithm. Through simulation experiments, the QPS processing capability of DWLOAD is improved by about 50% compared with the smooth polling algorithm in large-scale scenarios, which effectively improves the efficiency and reliability of load balancing in high-load situations in microservices and reduces the comprehensive response time of the system.\",\"PeriodicalId\":231070,\"journal\":{\"name\":\"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICIT55386.2022.9930161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICIT55386.2022.9930161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在微服务中,为了保持系统在高并发情况下的效率和可靠性,同时也为了解决微服务中负载均衡器轮询方法无法适应高并发、高负载情况的问题,结合实际应用场景,提出了一种基于虚拟节点的动态权重服务器算法DWLOAD (Dynamic Weight Loading algorithm)。该算法在平滑轮询负载算法的基础上引入了虚拟节点和实时权重的概念。DWLOAD算法通过计算同一微服务模块部署在不同服务器上的最近请求数、响应时间和吞吐量,获取各服务器的实时权重,并记录在权重表中,采用平滑轮询加载算法批量初始化虚拟节点。使用平滑轮询负载算法批量初始化虚拟节点。通过仿真实验,与平滑轮询算法相比,DWLOAD在大规模场景下的QPS处理能力提高了约50%,有效提高了微服务高负载情况下负载均衡的效率和可靠性,缩短了系统的综合响应时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research and Improvement of Dynamic Highly Available Load Balancing Algorithm for Microservices
In microservices, in order to maintain the efficiency and reliability of the system under high concurrency and to solve the problem that the load balancer polling method in microservices cannot adapt to the high concurrency and high load situation, an algorithm DWLOAD (Dynamic Weight Loading Algorithm) is proposed for the dynamic weight server based on virtual nodes in conjunction with the actual application scenario. The algorithm introduces the concepts of virtual nodes and real-time weights based on a smooth polling load algorithm. The DWLOAD algorithm calculates the number of recent requests, response time, and throughput of the same microservice module deployed in different servers to obtain the real-time weights of each server and records them in the weights table, and uses the smooth polling loading algorithm to initialize virtual nodes in batches. The virtual nodes are initialized in batches using a smooth polling load algorithm. Through simulation experiments, the QPS processing capability of DWLOAD is improved by about 50% compared with the smooth polling algorithm in large-scale scenarios, which effectively improves the efficiency and reliability of load balancing in high-load situations in microservices and reduces the comprehensive response time of the system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信