A Formal Approach using PEPA to Performance Analysis of Service-Oriented Architecture Style Specified through Graph Transformation System

International Journal of Computer Science and Engineering

© 2018 by SSRG - IJCSE Journal

Volume 5 Issue 7

Year of Publication : 2018

Authors : Afshin Bamshadi

10.14445/23488387/IJCSE-V5I7P104

How to Cite?

Afshin Bamshadi, "A Formal Approach using PEPA to Performance Analysis of Service-Oriented Architecture Style Specified through Graph Transformation System," SSRG International Journal of Computer Science and Engineering , vol. 5,  no. 7, pp. 21-29, 2018. Crossref, https://doi.org/10.14445/23488387/IJCSE-V5I7P104

Abstract:

By spread of distributed extensive, concurrent software systems, and the necessity of possessing an efficiently acceptable software, it is required that performance evaluation be ensued during the preliminary processes of software development prior to implementation. Modifying the software following the implementation, with the purpose of increasing efficiency would be both cost-effective and time-consuming. Among the present architectural styles, service-oriented style is the best alternative to cope with extensiveness and distributedness due to its highest level of abstractiveness. Graph transformation system (GTS) is a formal, intelligible and dynamic language for architectural modeling. In this study, we have presented a method implying PEPA language for performance evaluation of service-oriented architectural style which has been modeled by graph transformation system. To assess performance evaluation through PEPA there is a need for identifying systems behavior and structure, which have been extracted from the graphs; this means that the architectural model specified by graph transformation systems has been transformed to PEPA performance model which is a formal modeling performance language based on process algebra. Finally action throughput of software systems and state of utilization of each component and also capacity utilization of each component has been analyzed and their related charts have been represented.

Keywords:

Service-oriented architectural style, graph transformation system, PEPA, performance evaluation, software architecture.

References:

[1] T. Kauppi, ”Performance analysis at the software architectural level,” Technical report, ISSN: 14550849, 2003. 
[2] R. N. Taylor, N. Medvidovic, and E. M. Dashofy, Software Architecture: Foundations, Theory, and Practice, New York, NY, USA: John Wiley, 2008. 
[3] S. Thöne, “Dynamic Software Architectures A Style-Based Modeling and Refinement Technique with Graph Transformations,” Ph.D thesis, University of Paderborn, Paderborn, Germany, 2005. 
[4] V. Rafe, “Senario-driven analysis of systems specified through graph transformation,” Visual Language and Computing, vol. 24, pp. 136-145, 2013. 
[5] V. Rafe, and F. Mahdian, “Style-based modeling and verification of fault tolerance service oriented architectures,” Procedia Computer Science, vol. 3, pp. 972-976, 2011. 
[6] F. Aquilani, S. Balsamo, and P. Inverardi, “Performance analysis at the software architectural design level,” Performance Evaluation, vol. 45, pp. 147-178, 2001. 
[7] L. Dai and K. Cooperb, “Modeling and performance analysis for security aspects,” Science of Computer Programming, vol. 61, pp. 58-71, 2006. 
[8] L. Kloul, “Performance Analysis of a Software Retrieval Service,” Electronic Notes in Theoretical Computer Science, vol. 232, pp. 145-163, 2009. 
[9] L. baresi, R. heckel, S. Thone, and D. Varro, “Modeling and Validation of Service-Oriented Architectures,” Application vs. Style. Proc.3th Int. Conf. ESEC/FSE. pp. 68-77, 2003. 
[10] H. Zo, D. L. Nazareth, and H. K. Jain, “Security and performance in service-oriented applications: Trading off competing objectives,” Decision Support Systems, vol. 50, pp. 336-346, 2010. 
[11] A. Danilkina, P. Reinecke, and K. Wolter, “SFERA: A Simulation Framework for the Performance Evaluation of Restart Algorithms in Service-Oriented Systems,” Electronic Notes in Theoretical Computer Science. Vol. 291, pp. 3-14, 2013. 
[12] L. Gonczy, M. Kovacs, and D. Varro, “Modeling and Verification of Reliable Messaging by Graph Transformation Systems,” Electronic Notes in Theoretical Computer Science, vol. 175, pp. 37-50, 2007. 
[13] L. Baresi, V. Rafe, A. T. Rahmani, and P. Spoletini, “An Efficient Solution for Model Checking Graph Transformation Systems,” Electronic Notes in Theoretical Computer Science, vol. 213, pp. 3-21, 2008. 
[14] R. Heckel, G. Lajios, and S. Menge, “Graph Transformation, ” Lecture Notes in Computer Science,; vol. 3256, pp. 210-255, 2004. 
[15] R. Heckel, “Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks,” Lecture Notes in Computer Science, vol. 3722, pp. 53-69, 2005. 
[16] O. Runge, C. Ermel, and G Taentzer, “AGG 2.0– New Features for Specifying and Analyzing Algebraic Graph Transformations,” LNCS, vol. 7233, pp. 81-88, 2012. 
[17] J. Hillston, “ Tuning Systems :From Composition to Performance,” The Computer Journal, vol. 48, pp. 385-400, 2005. 
[18] J. Hillston, “A Compositional Approach to Performance Modeling,” Ph.D thesis, University of Edinburgh, Edinburgh, Scotland, 1994.