Abstract
This paper deals with a single-server queue with modulated arrivals, service requirements and service capacity. In our first result, we derive the mean of the total workload assuming generally distributed service requirements and any service discipline which does not depend on the modulating environment. We then show that the workload is exponentially distributed under heavy-traffic scaling. In our second result, we focus on the discriminatory processor sharing (DPS) discipline. Assuming exponential, class-dependent service requirements, we show that the joint distribution of the queue lengths of different customer classes under DPS undergoes a state-space collapse when subject to heavy-traffic scaling. That is, the limiting distribution of the queue-length vector is shown to be exponential, times a deterministic vector. The distribution of the scaled workload, as derived for general service disciplines, is a key quantity in the proof of the state-space collapse.
Similar content being viewed by others
References
Altman, E., Jimenez, T., Kofman, D.: DPS queues with stationary ergodic service times and the performance of TCP in overload. Proc. IEEE Infocom 2, 975–983 (2004)
Altman, E., Avrachenkov, K., Ayesta, U.: A survey on discriminatory processor sharing. Queueing Syst. 53, 53–63 (2006)
Asmussen, S.: The heavy traffic limit of a class of Markovian queueing models. Oper. Res. Lett. 6(6), 301–306 (1987)
Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003)
Avrachenkov, K., Ayesta, U., Brown, P., Núñez-Queija, R.: Discriminatory processor sharing revisited. Proc. IEEE Infocom 2, 784–795 (2005)
Billingsley, P.: Convergence of Probability Measures. Wiley, New York (1999)
Blom, J., Kella, O., Mandjes, M., Thorsdottir, H.: Markov-modulated infinite-server queues with general service times. Queueing Syst. 76(4), 403–424 (2014)
Borst, S.C., van Ooteghem, D., Zwart, A.: Tail asymptotics for discriminatory processor sharing queues with heavy-tailed service requirements. Perform. Eval. 61, 281–298 (2005)
Borst, S.C., Núñez-Queija, R., Zwart, A.: Sojourn time asymptotics in processor sharing queues. Queueing Syst. 53, 31–51 (2006)
Boxma, O.J., Kurkova, I.A.: The M/G/1 queue with two service speeds. Adv. Appl. Probab. 33(2), 520–540 (2001)
Budhiraja, A., Ghosh, A., Liu, X.: Scheduling control for Markov-modulated single-server multiclass queueing systems in heavy traffic. Queueing Syst. 78(1), 57–97 (2014)
Dimitrov, M.: Single-server queueing system with Markov-modulated arrivals and service times. Pliska Stud. Math. Bulg. 20, 53–62 (2011)
Dorsman, J.L., Vlasiou, M., Zwart, B.: Heavy-traffic asymptotics for networks of parallel queues with Markov-modulated service speeds. Queueing Syst. 79(3–4), 293–319 (2015)
Grishechkin, S.: On a relationship between processor sharing queues and Crump–Mode–Jagers branching processes. Adv. Appl. Probab. 24(3), 653–698 (1992)
Falin, G., Falin, A.: Heavy traffic analysis of M/G/1 type queueing systems with Markov-modulated arrivals. Soc. Estad. Invest. Oper. 7(2), 279–291 (1999)
Fayolle, G., Mitrani, I., Iasnogorodski, R.: Sharing a processor among many job classes. J. ACM 27(3), 519–532 (1980)
Fiems, D., Altman, E.: Markov-modulated stochastic recursive equations with applications to delay-tolerant networks. Perform. Eval. 70(11), 965–980 (2013)
Hassin, R., Haviv, M.: To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems. Kluwer Academic Publishers, Boston (2003)
Izagirre, A., Ayesta, U., Verloop, I.M.: Interpolation approximations for the steady-state distribution in multi-class resource-sharing systems. Perform. Eval. 91, 56–79 (2015)
Izagirre, A., Ayesta, U., Verloop, I.M.: Heavy-traffic analysis of a multi-class queue with relative priorities. Probab. Eng. Inform. Sc. 29(2), 153–180 (2015)
Katsuda, T.: State-space collapse in stationarity and its application to a multiclass single-server queue in heavy traffic. Queueing Syst. 65(3), 237–273 (2010)
Kim, B., Kim, J.: A single server queue with Markov modulated service rates and impatient customers. Perform. Eval. 83–84, 1–15 (2015)
Kingman, J.F.C.: The single server queue in heavy traffic. Proc. Camb. Philos. Soc. 57(4), 902–904 (1961)
Kleinrock, L.: Time-shared systems: a theoretical treatment. J. ACM 14(2), 242–261 (1967)
Mahabhashyam, S., Gautam, N.: On queues with Markov modulated service rates. Queueing Syst. 51(1–2), 89–113 (2005)
Neuts, M.F.: Matrix-geometric Solutions in Stochastic Models, an Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1981)
Núñez-Queija, R.: Processor-sharing models for integrated-services networks. PhD thesis, Eindhoven University of Technology (2000)
Purdue, P.: The M/M/1 queue in a Markovian environment. Oper. Res. 22, 562–569 (1974)
Rege, K.M., Sengupta, B.: Queue-length distribution for the discriminatory processor-sharing queue. Oper. Res. 44(4), 653–657 (1996)
Regterschot, G.J.K., de Smit, J.H.A.: The queue M/G/1 with Markov-modulated arrivals and service. Math. Oper. Res. 11, 465–483 (1986)
Takine, T.: Single-server queues with Markov-modulated arrivals and service speed. Queueing Syst. 49, 7–22 (2005)
Verloop, I.M., Ayesta, U., Núñez-Queija, R.: Heavy-traffic analysis of a multiple-phase network with discriminatory processor sharing. Oper. Res. 59(3), 648–660 (2011)
Wu, Y., Bui, L., Johari, R.: Heavy traffic approximation of equilibria in resource sharing games. IEEE J. Sel. Areas Commun. 30(11), 2200–2209 (2012)
Yechiali, U., Naor, P.: Queueing problems with heterogeneous arrival and service. Oper. Res. 19, 722–734 (1971)
Zorine, A.V.: On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing. Queueing Syst. 76, 223–241 (2014)
Acknowledgments
The authors would like to thank Urtzi Ayesta, Joke Blom and Michel Mandjes for helpful discussions. This research was partially supported by the SMI Program of INP Toulouse.
Author information
Authors and Affiliations
Corresponding author
Appendix: Proof of Theorem 3.3
Appendix: Proof of Theorem 3.3
The proof Theorem 3.3 is based on Theorem 4 in [12], which can be adapted to our model as follows:
We start with notation and some preliminaries. Let \(\Lambda = \text {diag}(\lambda _1,\ldots ,\lambda _D)\), \(\bar{H}(s) = \text {diag}(1 - h_1(s),\ldots ,1 - h_D(s))\), \(C= \text {diag}(c_1,\ldots ,c_D)\) and \(\varvec{p}_0 = (p_{0,1},\ldots ,p_{0,D})\). Furthermore \(\bar{H}_1\) and \(\bar{H}_2\) are the diagonal matrices corresponding to the moments \(h_{d1}\) and \(h_{d2}\), respectively, for \(d=1,\ldots ,D\). Recall Eq. (3), \([Q\cdot \varvec{a}]_d = c_d - \lambda _d h_{d1} -c_\infty (1-\rho _\infty )\). We will now construct a partial inverse of Q to make it easier to find a vector \(\varvec{a}\) which solves this equation. Let \(Q_1\) and R be matrices such that
Then \(\det Q_1 \ne 0\) and, due to Q being a generator (for more details, see [12]), we have
It follows that for any vector \(\varvec{x}\), it holds that
Then it can be verified with straightforward calculations that
is a possible solution vector, with \(\varvec{r} := c_\infty (1-\rho _\infty )R\varvec{e}\).
Define the vector \(\varvec{\varphi } = (\varphi _1(s),\ldots ,\varphi _D(s))\) and write Eq. (5) in matrix-vector terms:
Observe that, according to Eq. (7),
Now multiply from the right both sides of the new vector-matrix equation, Eq. (35), with a D-dimensional vector of 1’s, \(\varvec{e}\), to obtain
Multiply from the right both sides of Eq. (35) with the matrix R to get
Rewrite this equation by using the property of Eq. (33) to obtain
Iterate Eq. (37) with itself by inserting \(\varvec{\varphi }(s)\) into the right-hand side of the equation to obtain, after some algebraic transformations,
with \(G(s) := \Lambda \bar{H}(s) - sC\) and
Substitute Eq. (38) into Eq. (36) to obtain an expression for \(\varphi _1(s)\):
with \(B_1(s) = \varvec{y}(s)G(s)\varvec{e} + s c_\infty (1-\rho _\infty )\), \(B_2(s) = \varvec{\pi }G(s)\varvec{e}\) and \(B_3(s) = \varvec{\pi }G(s)RG(s)\varvec{e}\).
The next step is to insert the scaling \(s \mapsto s/N\) for each term. Recall that using the heavy-traffic parametrization introduced in Sect. 2, we have \((1-\rho _\infty )=1/N\). Now observe that, as \(N\rightarrow \infty \),
Therefore the limit
is a constant, and since \(|\varvec{\varphi }(s/N)| \le 1\) and \(\varvec{p}^{(N)}_0 \rightarrow 0\) (see Eq. (7)), we have
as \(N\rightarrow \infty \). Combining the above we obtain
Then
since \(\varvec{\pi } \Lambda \bar{H}_1 \varvec{e} = \sum _{d=1}^D \pi _d\lambda _d h_{d1} = \rho _\infty c_\infty \). Furthermore,
due to \(R \left[ C - \Lambda \bar{H}_1\right] \varvec{e} = \varvec{a} + \varvec{r}\); see Eq. (34). Under the heavy-traffic scaling,
is an o(1) term. Observe that
Rearranging Eq. (40) yields
Let M be the desired mean stated in Theorem 3.3, that is,
Then, taking the heavy-traffic limit,
i.e. the LST \(\varvec{\varphi }(s)\) converges in distribution to the LST of an exponentially distributed random variable with mean M.
Rights and permissions
About this article
Cite this article
Thorsdottir, H., Verloop, I.M. Markov-modulated M/G/1-type queue in heavy traffic and its application to time-sharing disciplines. Queueing Syst 83, 29–55 (2016). https://doi.org/10.1007/s11134-016-9477-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-016-9477-y