Queueing analysis of a server node in transaction processing middleware systems

Abstract

Quantitative performance modeling of complex information systems is of immense importance for designing enterprise e-business infrastructures and applications. In this paper, we present a traffic model of a server node in a typical transaction processing middleware system as well as a quantitative framework to model and analyze its performance. A multi-class open queueing network model is presented in which multi-class jobs are admitted to a number of server processes sharing hardware resources including the CPU and the disk. We have developed a viable approximation method, which decomposes the dependent components into their independent counterparts while preserving their relevant characteristics. We have conducted queueing-theoretic delay analyses and verified the approach using simulation. Results demonstrate the strength of our approach in predicting delays, elapsed times and other system performance measures.