Abstract
Purchase PDF (478 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (4)
Purchase PDF (2586 K)
3 dimensions and apply the results to the SO(
2 dimensions, stressing differences of the non-compact to the compact cases. These include infrared instead of ultraviolet asymptotic freedom, lack of an energy gap, failure (in the QP
doi:10.1016/j.peva.2005.03.004 
Copyright © 2005 Elsevier B.V. All rights reserved.
SimQPN—A tool and methodology for analyzing queueing Petri net models by means of simulation
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Received 17 June 2004;
Abstract
The queueing Petri net (QPN) paradigm provides a number of benefits over conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using queueing Petri nets (QPNs), one can integrate both hardware and software aspects of system behavior into the same model. This lends itself very well to modeling distributed component-based systems, such as modern e-business applications. However, currently available tools and techniques for QPN analysis suffer the state space explosion problem, imposing a limit on the size of the models that are tractable. In this paper, we present SimQPN—a simulation tool for QPNs that provides an alternative approach to analyze QPN models, circumventing the state space explosion problem. In doing this, we propose a methodology for analyzing QPN models by means of discrete event simulation. The methodology shows how to simulate QPN models and analyze the output data from simulation runs. We validate our approach by applying it to study several different QPN models, ranging from simple models to models of realistic systems. The performance of point and interval estimators implemented in SimQPN is subjected to a rigorous experimental analysis.
Keywords: Queueing Petri nets; Simulation modeling; Performance prediction; Capacity planning; Distributed component-based systems
Article Outline
- 1. Introduction
- 2. Queueing Petri nets
- 3. SimQPN—simulator for queueing Petri nets
- 3.1. SimQPN features
- 3.2. Design and architecture
- 3.3. Random number generation
- 3.4. Output data analysis
- 3.4.1. Modes of data collection
- 3.4.2. Steady state analysis
- 3.4.2.1. Elimination of initialization bias
- 3.4.2.2. Replication/deletion approach
- 3.4.2.3. Method of non-overlapping batch means
- 4. SimQPN validation and performance analysis
- 4.1. Method of coverage analysis used
- 4.2. QPN model of SPECjAppServer2001's customer domain
- 4.3. Product-form queueing network
- 4.4. QPN model of SPECjAppServer2002
- 5. Summary and conclusions
- 6. Ongoing and future work
- Acknowledgements
- References
This work was partially funded by BEA Systems, Inc., as part of the project “Performance modeling and evaluation of large-scale J2EE applications” and the Deutsche Forschungsgemeinschaft (DFG) as part of the PhD program “Enabling technologies for E-commerce” at Darmstadt University of Technology.
Corresponding author. Tel.: +49 6151 166231; fax: +49 6151 166229. 
