Performance Analysis of Transaction Driven Computer Systems via Queueing Analysis of Polling Models

The objective of this paper is the modeling and analysis of a class of computer systems whose primary task is the massive processing of batch transitions and which we call transaction driven computer systems (TDCS‘s). We present a generic queueing model for transaction driven computer systems and we calculate the mean sojourn time experienced by the different transactions. Our approach is to model a TDCS by a cyclic polling system with bulk arrivals, deterministic service times, limited-1 service, and zero switch-over periods. Since the performance analysis of this polling model has not been provided before we concentrate in the paper on deriving mean delay approximations for it. Our analysis is carried out for models with general switch-over periods, and a special case of it (zero switch-over periods) is suitable for analyzing a TDCS.