{"title":"有界缓冲区微服务系统的复杂行为交互分析方法","authors":"Shuo Wang;Zhijun Ding;Ru Yang;Changjun Jiang","doi":"10.1109/TCC.2023.3319038","DOIUrl":null,"url":null,"abstract":"The interaction process in microservice architectures is highly complex, making it very challenging to ensure correct behavioral interactions. The few related works focus only on the verification of interaction soundness in the case of a specific buffer \n<italic>k</i>\n-value, without considering how to get the suitable buffer \n<italic>k</i>\n-value. To solve the above problems, this article proposes a method to find the maximum \n<italic>k</i>\n-value for microservice systems with bounded buffers, which can maximize the analysis of valuable asynchronous interaction paths while avoiding the waste of computer memory resources. Specific contributions include, first, giving the relationship between buffer \n<italic>k</i>\n-value and asynchronous interaction paths, interaction soundness, and its proof; second, proposing an iterative detection based on the additional added paths algorithm and its correctness proof, which leads to the conclusion that finding the maximum \n<italic>k</i>\n-value is a decidable problem; finally, validating the proposing methods on ten classical cases of microservice systems, and analyzing effectiveness and performance. The experimental results show that the method can effectively find the maximum \n<italic>k</i>\n-value of bounded buffers compared with existing methods and thus ensure the correct behavioral interactions of microservice systems.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Complex Behavioral Interaction Analysis Method for Microservice Systems With Bounded Buffers\",\"authors\":\"Shuo Wang;Zhijun Ding;Ru Yang;Changjun Jiang\",\"doi\":\"10.1109/TCC.2023.3319038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The interaction process in microservice architectures is highly complex, making it very challenging to ensure correct behavioral interactions. The few related works focus only on the verification of interaction soundness in the case of a specific buffer \\n<italic>k</i>\\n-value, without considering how to get the suitable buffer \\n<italic>k</i>\\n-value. To solve the above problems, this article proposes a method to find the maximum \\n<italic>k</i>\\n-value for microservice systems with bounded buffers, which can maximize the analysis of valuable asynchronous interaction paths while avoiding the waste of computer memory resources. Specific contributions include, first, giving the relationship between buffer \\n<italic>k</i>\\n-value and asynchronous interaction paths, interaction soundness, and its proof; second, proposing an iterative detection based on the additional added paths algorithm and its correctness proof, which leads to the conclusion that finding the maximum \\n<italic>k</i>\\n-value is a decidable problem; finally, validating the proposing methods on ten classical cases of microservice systems, and analyzing effectiveness and performance. The experimental results show that the method can effectively find the maximum \\n<italic>k</i>\\n-value of bounded buffers compared with existing methods and thus ensure the correct behavioral interactions of microservice systems.\",\"PeriodicalId\":13202,\"journal\":{\"name\":\"IEEE Transactions on Cloud Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2023-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Cloud Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10262266/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10262266/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
摘要
微服务架构中的交互过程非常复杂,因此确保正确的行为交互非常具有挑战性。为数不多的相关著作只关注特定缓冲区 k 值情况下交互合理性的验证,而没有考虑如何获得合适的缓冲区 k 值。为了解决上述问题,本文提出了一种为缓冲区有界的微服务系统寻找最大 k 值的方法,可以最大限度地分析有价值的异步交互路径,同时避免计算机内存资源的浪费。具体贡献包括:首先,给出了缓冲区k值与异步交互路径之间的关系、交互健全性及其证明;其次,提出了基于额外添加路径算法的迭代检测方法及其正确性证明,从而得出寻找最大k值是一个可解问题的结论;最后,在十个微服务系统的经典案例上验证了所提出的方法,并分析了有效性和性能。实验结果表明,与现有方法相比,该方法能有效求出有界缓冲区的最大k值,从而保证微服务系统行为交互的正确性。
A Complex Behavioral Interaction Analysis Method for Microservice Systems With Bounded Buffers
The interaction process in microservice architectures is highly complex, making it very challenging to ensure correct behavioral interactions. The few related works focus only on the verification of interaction soundness in the case of a specific buffer
k
-value, without considering how to get the suitable buffer
k
-value. To solve the above problems, this article proposes a method to find the maximum
k
-value for microservice systems with bounded buffers, which can maximize the analysis of valuable asynchronous interaction paths while avoiding the waste of computer memory resources. Specific contributions include, first, giving the relationship between buffer
k
-value and asynchronous interaction paths, interaction soundness, and its proof; second, proposing an iterative detection based on the additional added paths algorithm and its correctness proof, which leads to the conclusion that finding the maximum
k
-value is a decidable problem; finally, validating the proposing methods on ten classical cases of microservice systems, and analyzing effectiveness and performance. The experimental results show that the method can effectively find the maximum
k
-value of bounded buffers compared with existing methods and thus ensure the correct behavioral interactions of microservice systems.
期刊介绍:
The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.