Coloured Petri Nets Model for Web Architectures of Web and Database Servers

Authors: Nidhi Gaur, Padmaja Joshi, Vijay Jain, Rajeev Srivastava

Abstract:

Web application architecture is important to achieve the desired performance for the application. Performance analysis studies are conducted to evaluate existing or planned systems. Web applications are used by hundreds of thousands of users simultaneously, which sometimes increases the risk of server failure in real time operations. We use Coloured Petri Net (CPN), a very powerful tool for modelling dynamic behaviour of a web application system. CPNs extend the vocabulary of ordinary Petri nets and add features that make them suitable for modelling large systems. The major focus of this work is on server side of web applications. The presented work focuses on modelling restructuring aspects, with major focus on concurrency and architecture, using CPN. It also focuses on bringing out the appropriate architecture for web and database servers given the number of concurrent users.

Keywords: Coloured petri nets, concurrent users, performance modelling, web application architecture.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1339628

References:

[1] J. T. Vicenc Beltran and E. Ayguade, “Improving web server perfor- mance through main memory compression,” 14th IEEE International Conference on Parallel and Distributed Systems, 2008.
[2] D. K. Mahnaz Shams and B. Far, “A model-based approach for testing the performance of web applications,” Proceedings of the Third International Workshop on Software Quality Assurance, 2006.
[3] S. M. Manish Marwah and C. Fetzer, “Fault-tolerant and scalable tcp splice and web server architecture,” 25th IEEE Symposium on Reliable Distributed Systems, 2006.
[4] R. H. Zhong Xu and L. N. Bhuyan, “Load balancing of dns-based distributed web server systems with page caching,” Proceedings of the Tenth International Conference on Parallel and Distributed Systems,2004.
[5] E. Casalicchio and S. Tucci, “Static and dynamic scheduling algorithms for scalable web server farm.”
[6] B. Spitznagel and D. Garlan, “Architecture based performance anal- ysis,” Proceedings of 1998 Conference on Software Engineering and Knowledge Engineering, pp. 146–151, 1998.
[7] Q. Zhaoyang, W. wei, and L. Zhiqian, “Web server optimization model based on performance analysis,” In IEEE Proceedings of 6th International Conference on Wireless Communication Networking and Mobile Computing, pp. 1–4, 2010.
[8] J. Zhang, C. Chang, S. Kim, and J. Y. Chung, “Ws-net: A petri-net Model based specification model for web services,” In IEEE of International Conference on Web Services, 2004.
[9] S.Kounex and A.Buchhman, “Performance modelling of distributed e-business applications using queuing petri nets,” IEEE Proceedings, 2003.
[10] X. Hai-yan and W. Yan, “Workflow model based on stochastic petri nets and performance evaluation,” IEEE International Symposium on IT in Medicine Education, vol. 1, pp. 245–249, 2009.
[11] J. Wang, Petri nets for dynamic event driven system modeling, 2007.
[12] S. Samolej and T. Rak, “Simulation and performance analysis of distributed internet systems using tcpns,” Informatica, vol. 33, pp. 405–415, 2009.
[13] L. M. K. Lisa Wells, Sprren Christensen and K. H. Mortensen, “Sim- ulation based performance analysis of web servers,” IEEE, 2001.
[14] C A Petri, “Kommunikation mit automaten,” Schriften des Rheinisch-6Westflischen Institutes fr Instrumentelle Mathematik an der UniversittBonn Nr. 2, 1962.
[15] T. Muratha, “Petri nets:properties analysis and applications,” Proceed- ings of IEEE, vol. 77, no. 4, pp. 541–580, November 1989.
[16] R. Zurawaski and M. Zhou, “Petri nets and industrial applications: a tutorial,” IEEE Transactions on Industrial Electronics, vol. 41, no. 4, pp. 567–583, December 1994.
[17] D. G. M. Heiner and R. Donaldson, “Petri nets for systems and synthetic biology,” Formal Methods for Computational Systems Biology, LNCS,2008, vol. 5016, pp. 215–264, 2008.
[18] K. Jensen, “Coloured petri nets. basic concepts, analysis methods and practical use,” Basic Concepts. Monographs in Theoretical Computer Science, Springer-Verlag, vol. 1, 1997.
[19] PIPE-2, “http://pipe2.sourceforge.net/,” 2007.
[20] A. Charalambous, “Extension of pipe2 to support coloured generalised stochastic petri nets,” PhD thesis, Imperial College of London, 2010.
[21] R. P. Pere Bonet, Catalina M. Llado, “Pipe v2.5: a petri net tool for performance modeling.”
[22] A. Kostin, “A reachability algorithm for general petri nets based on transition invariants,” Springer-Verlag, ISBN 978-3540377917, Lecture Notes in Computer Science, vol. 4162, pp. 608–621, 2006.
[23] J. Farkas, “Theorie der einfachen ungleichungen,” ur die Reine und Angewandte Mathematik, vol. 6, pp. 124–127, 1902.