Exploiting restricted transitions in Quasi-Birth-and-Death processes

In this paper we consider quasi-birth-and-death (QBD) processes where the upward (resp. downward) transitions are restricted to occur only from (resp. to) a subset of the phase space. This property is exploited to reduce the computation time to find the matrix R or G of the process. The reduction is...

Full description

Autores:
Tipo de recurso:
Fecha de publicación:
2009
Institución:
Universidad del Rosario
Repositorio:
Repositorio EdocUR - U. Rosario
Idioma:
eng
OAI Identifier:
oai:repository.urosario.edu.co:10336/28499
Acceso en línea:
https://doi.org/10.1109/QEST.2009.18
https://repository.urosario.edu.co/handle/10336/28499
Palabra clave:
Design for quality
Equations
Performance analysis
Mathematics
Computer science
Queueing analysis
State-space methods
Acceleration
Distributed computing
MATLAB
Rights
License
Restringido (Acceso a grupos específicos)
Description
Summary:In this paper we consider quasi-birth-and-death (QBD) processes where the upward (resp. downward) transitions are restricted to occur only from (resp. to) a subset of the phase space. This property is exploited to reduce the computation time to find the matrix R or G of the process. The reduction is done through the definition of a censored process which can be of the M/G/1- or GI/M/1-type. The approach is illustrated through examples that show the applicability and benefits of making use of the additional structure. The examples also show how these special structures arise naturally in the analysis of queuing systems. Even more substantial gains can be realized when we further restrict the class of QBD processes under consideration.