Analysis of the GIMSPcr Queueing System F.J.Albores–Velasco, F.S.Tajonar–Sanabria.pdfVIP

Информационные процессы, Том 4, № 1, 2004, стр. 46–57. c 2004 Albores, Tajonar. INFORMATION THEORY AND INFORMATION PROCESSING Analysis of the GI/MSP/c/r Queueing System F.J.Albores–Velasco, F.S.Tajonar–Sanabria Facultad de Ciencias Fisico Matematicas, BUAP. Av. San Claudio y Rio Verde, Col. San Manuel, Ciudad Universitaria. C.P. 72570, Puebla, Pue., Mexico Received January 10, 2004 Abstract—The analysis of a queueing system with c servers, recurrent general arrivals, service time of Markovian type and common buffer of finite capacity is realized. Using linearwise Markov processes, a integral-differential model for the performance of the system is built. An order, established among the states of the model, facilitates the construction of an algorithmic procedure for the calculation of steady state system characteristics. 1. INTRODUCTION In this work we analyze the GI |MSP |c|r multi-channel queueing system, whose main characteristic is that the service time in each server is of Markovian type. This system, for the one channel case, was studied by Bocharov in [3]. In general we maintain his notation and methodology. The new element that we incorporate to the analysis, is a detailed study of the system, in the case when it has free servers. This study is based in a multi-dimensional ordering of the state set of the system. The necessity of an additional effort in the study of multi-channel systems for the case when not all servers are occupied has been pointed out in earlier works [1,6,7]. In these works the analysis of the system M |M |c|r [6], as well as of systems of gr