Terminal Micro-service Discovery Algorithm based on attractor model

Li Wang, Siyu Tang, Jiageng Zhang, Heshan Wang, Jiawei Han, Jianxiang Cao
{"title":"Terminal Micro-service Discovery Algorithm based on attractor model","authors":"Li Wang, Siyu Tang, Jiageng Zhang, Heshan Wang, Jiawei Han, Jianxiang Cao","doi":"10.1109/ICCEAI52939.2021.00086","DOIUrl":null,"url":null,"abstract":"In the intensive computing scenario with the application of micro-service framework, it is too costly to allocate resources centrally to the micro-service instance on the server side, and it cannot adapt to the changes of the environment in real time. Therefore, allocating resource for micro-service instance distributed on the terminal becomes an effective way to solve the problem mentioned above. A client-based micro-service discovery algorithm with attractor selection model is proposed in this paper, which has the characters of simple and intelligent evolution. At first, this paper models micro-service discovery problem, defines optimization object and constraints; then, it re-defines the parameters of attractor selection and proposes the client-based micro-service discovery algorithm with attractor selection model; and at last, it analyzes the performance of the proposed algorithm with the compared ones in the really productive environment. The experiment results show that the proposed algorithm reduces almost 32 % resource fragments and 70% running time than the compared ones.","PeriodicalId":331409,"journal":{"name":"2021 International Conference on Computer Engineering and Artificial Intelligence (ICCEAI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer Engineering and Artificial Intelligence (ICCEAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEAI52939.2021.00086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the intensive computing scenario with the application of micro-service framework, it is too costly to allocate resources centrally to the micro-service instance on the server side, and it cannot adapt to the changes of the environment in real time. Therefore, allocating resource for micro-service instance distributed on the terminal becomes an effective way to solve the problem mentioned above. A client-based micro-service discovery algorithm with attractor selection model is proposed in this paper, which has the characters of simple and intelligent evolution. At first, this paper models micro-service discovery problem, defines optimization object and constraints; then, it re-defines the parameters of attractor selection and proposes the client-based micro-service discovery algorithm with attractor selection model; and at last, it analyzes the performance of the proposed algorithm with the compared ones in the really productive environment. The experiment results show that the proposed algorithm reduces almost 32 % resource fragments and 70% running time than the compared ones.
基于吸引子模型的终端微服务发现算法
在应用微服务框架的密集计算场景中,将资源集中分配给服务器端的微服务实例成本过高,且不能实时适应环境的变化。因此,为分布在终端上的微服务实例分配资源成为解决上述问题的有效途径。提出了一种基于吸引子选择模型的基于客户端的微服务发现算法,该算法具有简单、智能进化的特点。首先对微服务发现问题进行建模,定义优化对象和约束条件;然后,重新定义了吸引子选择的参数,提出了基于吸引子选择模型的基于客户端的微服务发现算法;最后,在实际生产环境中,对比分析了所提算法的性能。实验结果表明,该算法比对比算法减少了近32%的资源碎片和70%的运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信