scholarly journals A New Decomposition Method for Designing Microservices

2019 ◽  
Vol 63 (4) ◽  
pp. 274-281 ◽  
Author(s):  
Omar Al-Debagy ◽  
Peter Martinek

Many companies are migrating from monolithic architectures to microservice architectures, and they need to decompose their applications in order to create a microservices application. Therefore, the need comes for an approach that helps software architects in the decomposition process. This paper presents a new approach for decomposing monolithic application to a microservices application through analyzing the application programming interface. Our proposed decomposition methodology uses word embedding models to obtain word representations using operation names, as well as, using a hierarchical clustering algorithm to group similar operation names together in order to get suitable microservices. Also, using grid search method to find the optimal parameter values for Affinity Propagation algorithm, which was used for clustering, as well as using silhouette coefficient score to compare the performance of the clustering parameters. The decomposition approach that was introduced in this research consists of the OpenAPI specifications as an input, then extracts the operation names from the specifications and converts them into average word embedding using fastText model. Lastly the decomposition approach is grouping these operation names using Affinity Propagation algorithm. The proposed methodology presented promising results with a precision of 0.84, recall of 0.78 and F-Measure of 0.81.

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Mu Zhu ◽  
Fanrong Meng ◽  
Yong Zhou

Most of the existing clustering algorithms for networks are unsupervised, which cannot help improve the clustering quality by utilizing a small number of prior knowledge. We propose a semisupervised clustering algorithm for networks based on fast affinity propagation (SCAN-FAP), which is essentially a kind of similarity metric learning method. Firstly, we define a new constraint similarity measure integrating the structural information and the pairwise constraints, which reflects the effective similarities between nodes in networks. Then, taking the constraint similarities as input, we propose a fast affinity propagation algorithm which keeps the advantages of the original affinity propagation algorithm while increasing the time efficiency by passing only the messages between certain nodes. Finally, by extensive experimental studies, we demonstrate that the proposed algorithm can take fully advantage of the prior knowledge and improve the clustering quality significantly. Furthermore, our algorithm has a superior performance to some of the state-of-art approaches.


2015 ◽  
Vol 72 (1) ◽  
pp. 53-61 ◽  
Author(s):  
Eder Jorge de Oliveira ◽  
Fernanda Alves Santana ◽  
Luciana Alves de Oliveira ◽  
Vanderlei da Silva Santos

2013 ◽  
Vol 12 (18) ◽  
pp. 4544-4548 ◽  
Author(s):  
X.H. Chen ◽  
L. Niu ◽  
Y.J. Zhou ◽  
Z. Bi ◽  
G. Ding ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document