{"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}
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.