The Periodic BMAP/PH/c Queue

Authors:
Lothar Breuer
Affiliations:
University of Trier, Department IV – Computer Science, 54286 Trier, Germany breuer@info04.uni-trier.de
Venue:
Queueing Systems: Theory and Applications
Year:
2001

Citing 1
Cited 3

Introduction to matrix analysis (2nd ed.)

Introduction to matrix analysis (2nd ed.)

Transient and periodic solution to the time-inhomogeneous quasi-birth death process

Queueing Systems: Theory and Applications
The matrices R and G of matrix analytic methods and the time-inhomogeneous periodic Quasi-Birth-and-Death process

Queueing Systems: Theory and Applications
Periodic solution to the time-inhomogeneous multi-server Poisson queue

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In queueing theory, most models are based on time-homogeneous arrival processes and service time distributions. However, in communication networks arrival rates and/or the service capacity usually vary periodically in time. In order to reflect this property accurately, one needs to examine periodic rather than homogeneous queues. In the present paper, the periodic BMAP/PH/c queue is analyzed. This queue has a periodic BMAP arrival process, which is defined in this paper, and phase-type service time distributions. As a Markovian queue, it can be analysed like an (inhomogeneous) Markov jump process. The transient distribution is derived by solving the Kolmogorov forward equations. Furthermore, a stability condition in terms of arrival and service rates is proven and for the case of stability, the asymptotic distribution is given explicitly. This turns out to be a periodic family of probability distributions. It is sketched how to analyze the periodic BMAP/Mt/c queue with periodically varying service rates by the same method.