Average delay estimation for one queueing network model with resource reservation

Abstract

Introduction: An urgent task of today is to develop new analysis methods for complex information systems that now demand higher standards for maintaining data integrity. One of the important quality characteristics of such systems is average transaction time. However, currently there are almost no mathematical models and speed estimation tools for such systems. Purpose: To develop and analyze a distributed information system model based on queueing networks. Results: A type of information systems that demand higher standards for maintaining data integrity has been described, the corresponding assumptions for such systems are given. A convenient way to represent such systems as transaction paths dependency graphs has been proposed, with each path being represented as one tandem queueing system. The calculation of their functional characteristics have been provided. This method of representation has made it possible to simplify the analysis of complex systems, which resulted in obtaining closed-form expressions for temporal estimation of the system type in question. In addition, two mechanisms of decomposition of the proposed graph are considered with the subsequent calculation of the lower bound for average transaction time. The accuracy of both approaches is analyzed with simulation modeling methods. Practical relevance: The proposed models allow estimating speed limits of an information system during the design phase.