Nowadays, microservice architecture has become a dominant software development and deployment paradigm. Decomposing a system into loosely coupled, highly cohesive, and fine-grained microservices while meeting various ...
详细信息
Nowadays, microservice architecture has become a dominant software development and deployment paradigm. Decomposing a system into loosely coupled, highly cohesive, and fine-grained microservices while meeting various technical constraints and implementing business capabilities is particularly important for microservice system (MS) designers. When an MS has a large number of functionalities and complex interconnections, it is a big challenge to identify microservices solely based on the experience of MS designers. We propose a structured and automated microservice identification method to decompose a system into appropriate microservices for this challenge. We model a system as unified modeling language (UML) class and sequence diagrams. In the identification phase, we take into account not only the traditional coupling-related criteria but also the quality expectation and deployment constraints, both of which have not yet been fully concerned in previous studies. Based on the criteria, a microservice identification algorithm using the clustering technique is designed. A case study of elderly care services illustrates the identification process. Experiments are conducted to evaluate and compare the proposed method against state-of-the-art methods. Results indicate that the proposed method significantly outperforms those compared from the literature.
This study considers a service-deployment problem of C4ISR(Command, Control, Communication, Computer, Intelligence, Surveillance and Reconnaissance) system under service-oriented architecture. In order to make C4ISR s...
详细信息
This study considers a service-deployment problem of C4ISR(Command, Control, Communication, Computer, Intelligence, Surveillance and Reconnaissance) system under service-oriented architecture. In order to make C4ISR sufficiently agile to meet the challenges brought by diverse combat missions and highly adversarial combat processes, this paper adopts a distributed deployment method to deploy the service processes that constitute C4ISR in multiple data centers. Considering the service information requirements and the location of specific data, a deployment constraint for a service is proposed. Further, in order to improve resource utilization and reduce communication overhead, this paper establishes a distributed service deployment model facing the characteristics of C4ISR. For the large search space and complex constraints of the optimal problem, a multi-objective genetic simulated annealing algorithm is proposed by designing the neighboring individual generation rules and combining the simulated annealing mechanism and the genetic algorithm to enhance the ability of both local search and global search. The simulation results show that this method can produce a high-quality C4ISR service-deployment scheme effectively.
In service oriented computing we encounter the problem of coordinating autonomous services (e. g., micro-services) communicate within the deployment environments (e. g., multi-cloud infrastructures) but participate fo...
详细信息
ISBN:
(纸本)9783030003593;9783030003586
In service oriented computing we encounter the problem of coordinating autonomous services (e. g., micro-services) communicate within the deployment environments (e. g., multi-cloud infrastructures) but participate for the functional requirements. While the environments have the deployment concerns like real-time, security, privacy or even energy consumption constraints, for the sake of brevity, the formal models of coordination in service oriented systems generally abstract away these concerns and focus on the functional ones such as synchronization, data and context dependency constraints. In this paper, we consider Constraint Automata (CA) as a formal model of the functional behaviours for the Reo coordination networks without any buffered channel. We devise a distributed protocol to model execution the CA subject to the deployment constraints on the messaging within a network of processors derived from the Reo network structure. We assume the constraints are satisfied while the protocol messages go through the shortest paths in the network. The protocol itself is modelled by another formal model Network of Timed Automata (NTA) with the untimed transitions implemented by the Uppaal tool. Our protocol models the message passing along the shortest paths for performing a CA's transition by all the participant processors. The protocol guarantees all the processors do the same CA's transition as a consensus in the same round of execution.
暂无评论