Abstract
This paper considers stationary queues with multiple arrival streams governed by an irreducible Markov chain. In a very general setting, we first show an invariance relationship between the time-average joint queue length distribution and the customer-average joint queue length distribution at departures. Based on this invariance relationship, we provide a distributional form of Little's law for FIFO queues with simple arrivals (i.e., the superposed arrival process has the orderliness property). Note that this law relates the time-average joint queue length distribution with the stationary sojourn time distributions of customers from respective arrival streams. As an application of the law, we consider two variants of FIFO queues with vacations, where the service time distribution of customers from each arrival stream is assumed to be general and service time distributions of customers may be different for different arrival streams. For each queue, the stationary waiting time distribution of customers from each arrival stream is first examined, and then applying the Little's law, we obtain an equation which the probability generating function of the joint queue length distribution satisfies. Further, based on this equation, we provide a way to construct a numerically feasible recursion to compute the joint queue length distribution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen, Ladder heights and the Markov-modulated M/G/1 queue, Stochastic Process. Appl. 37 (1991) 313–326.
S. Asmussen and G. Koole, Marked point processes as limits of Markovian arrival streams, J. Appl. Probab. 30 (1993) 365–372.
B. Doshi, Generalizations of the stochastic decomposition results for single server queues with vacations, Stochastic Mod. 6 (1990) 307–333.
Q.-M. He, Queues with marked customers, Adv. in Appl. Probab. 28 (1996) 567–587.
Q.-M. He and M.F. Neuts, Markov chains with marked transitions, Stochastic Processes Appl. 74 (1998) 37–52.
J. Keilson and L.D. Servi, A distributional form of Little's law, Oper. Res. Lett. 7 (1988) 223–227.
D. König and V. Schmidt, Extended and conditional versions of the PASTA property, Adv. in Appl. Probab. 22 (1990) 510–512.
R.M. Loynes, The stability of a queue with non-independent interarrival and service times, Proc. Cambridge Philos. Soc. 58 (1962) 497–520.
D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991) 1–46.
D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single-server queue with server vacations and a class of non-renewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676–705.
D.M. Lucantoni and V. Ramaswami, Efficient algorithms for solving the non-linear matrix equations arising in phase type queues, Stochastic Models 1 (1985) 29–51.
M. Miyazawa, The derivation of invariance relations in complex queueing systems with stationary inputs, Adv. in Appl. Probab. 15 (1983) 874–885.
M. Miyazawa, Rate conservation law with multiplicity and its applications to queues, Technical report, Science University of Tokyo (1991).
M. Miyazawa, Rate conservation laws: A survey, Queueing Systems 15 (1994) 1–58.
M.F. Neuts, Structured Stochastic Matrices of the M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).
V. Ramaswami, Stable recursion for the steady state vector for Markov chains of M/G/1 type, Stochastic Models 4 (1988) 183–188.
G.J.K. Regterschot and J.H.A. de Smit, The queue M/G/1 with Markov modulated arrivals and services, Math. Oper. Res. 11 (1986) 465–483.
T. Takine, A nonpreemptive priority MAP/G/1 queue with two classes of customers, J. Oper. Res. Soc. Japan 39 (1996) 266–290.
T. Takine, A continuous version of matrix-analytic methods with the skip-free to the left property, Stochastic Models 12 (1996) 673–682.
T. Takine, Queue length distribution in a FIFO single-sever queue with multiple arrival streams having different service time distributions, submitted for publication (1999). (A copy of the paper is available on request.)
T. Takine, The nonpreemptive priority MAP/G/1 queue, Oper. Res. 47 (1999) 917–927.
T. Takine, A new recursion for the queue length distribution in the stationary BMAP/GI/1 queue, Stochastic Models 16 (2000) 335–341.
T. Takine and T. Hasegawa, The workload in the MAP/G/1 queue with state-dependent services: Its application to a queue with preemptive resume priority, Stochastic Models 10 (1994) 183–204.
T. Takine, Y. Matsumoto, T. Suda and T. Hasegawa, Mean waiting times in nonpreemptive priority queues with Markovian arrival and i.i.d. service processes, Performance Evaluation 20 (1994) 131–149.
T. Takine and Y. Takahashi, On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals, Stochastic Models 14 (1998) 601–610.
H.C. Tijms, Stochastic Models, An Algorithmic Approach (Wiley, Chichester, 1994).
Y. Zhu and N.U. Prabhu, Markov-modulated PH/G/1 queueing systems, Queueing Systems 9 (1991) 313–322.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Takine, T. Distributional Form of Little's Law for FIFO Queues with Multiple Markovian Arrival Streams and Its Application to Queues with Vacations. Queueing Systems 37, 31–63 (2001). https://doi.org/10.1023/A:1011088032716
Issue Date:
DOI: https://doi.org/10.1023/A:1011088032716