A Complex Behavioral Interaction Analysis Method for Microservice Systems With Bounded Buffers

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 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.