User Settings
Article

The Inhomogeneous BMAP/G/? Queue

Lothar Breuer,Dieter Baum-2001-01-01-Kent Academic Repository (University of Kent)
3

TL;DRAbstract

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, it is most natural to consider inhomogeneous arrival processes in queueing models. In the present paper, the inhomogeneous BMAP/G/∞ queue with time–dependent service time distributions is examined. Exact transient distributions as well as approximation formulae are derived. For the special case of homogeneous BMAP/G/∞ queues, stability conditions and asymptotic distributions are given. Finally, it is shown how to derive bounds for the (inhomogeneous) BMAP/G/c/c loss system by means of analyzing the BMAP/G/∞ (inhomogeneous) queue.

Chat with Paper

AI Agents for this Paper

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, it is most natural to consider inhomogeneous arrival processes in queueing models. In the present paper, the inhomogeneous BMAP/G/∞ queue with time–dependent service time distributions is examined. Exact transient distributions as well as approximation formulae are derived. For the special case of homogeneous BMAP/G/∞ queues, stability conditions and asymptotic distributions are given. Finally, it is shown how to derive bounds for the (inhomogeneous) BMAP/G/c/c loss system by means of analyzing the BMAP/G/∞ (inhomogeneous) queue.

Keywords

Bulk queueQueueing theoryQueueHomogeneousFork–join queueMathematicsApplied mathematicsBurke's theorem

Chat

Click to start Chat