Abstract
The stability of a cyclic polling system, with a single server and two infinite-buffer queues, is considered. Customers arrive at the two queues according to independent batch Markovian arrival processes. The first queue is served according to the gated service discipline, and the second queue is served according to a state-dependent time-limited service discipline with the preemptive repeat-different property. The state dependence is that, during each cycle, the predetermined limited time of the server’s visit to the second queue depends on the queue length of the first queue at the instant when the server last departed from the first queue. The mean of the predetermined limited time for the second queue either decreases or remains the same as the queue length of the first queue increases. Due to the two service disciplines, the customers in the first queue have higher service priority than the ones in the second queue, and the service fairness of the customers with different service priority levels is also considered. In addition, the switchover times for the server traveling between the two queues are considered, and their means are both positive as well as finite. First, based on two embedded Markov chains at the cycle beginning instants, the sufficient and necessary condition for the stability of the cyclic polling system is obtained. Then, the calculation methods for the variables related to the stability condition are given. Finally, the influence of some parameters on the stability condition of the cyclic polling system is analyzed. The results are useful for engineers not only checking whether the given cyclic polling system is stable, but also adjusting some parameters to make the system satisfy some requirements under the condition that the system is stable.
Similar content being viewed by others
References
Asmussen, S., Nerman, O., Olsson, M.: Fitting phase-type distributions via the EM algorithm. Scand. J. Stat. 23(4), 419–441 (1996)
Banik, A.D.: Stationary distributions and optimal control of queues with batch Markovian arrival process under multiple adaptive vacations. Comput. Ind. Eng. 65(3), 455–465 (2013)
Bobbio, A., Horváth, A., Telek, M.: Matching three moments with minimal acyclic phase type distributions. Stoch. Models 21(2–3), 303–326 (2005)
Boon, M.A.A., Adan, I.J.B.F.: Mixed gated/exhaustive service in a polling model with priorities. Queueing Syst. 63, 383–399 (2009)
Boon, M.A.A., Adan, I.J.B.F., Boxma, O.J.: A two-queue polling model with two priority levels in the first queue. Discret. Event Dyn. Syst. Theory Appl. 20(4), 511–536 (2010)
Boon, M.A.A., van der Mei, R.D., Winands, E.M.M.: Applications of polling systems. Surv. Oper. Res. Manag. Sci. 16(2), 67–82 (2011)
Breuer, L., Baum, D.: An Introduction to Queueing Theory and Matrix-Analytic Methods. Springer, Dordrecht (2005)
Buchholz, P., Kriege, J., Felko, I.: Input Modeling with Phase-Type Distributions and Markov Models: Theory and Applications. Springer, Cham (2014)
Fricker, C., Jaibi, M.R.: Monotonicity and stability of periodic polling models. Queueing Syst. 15(1), 211–238 (1994)
Gibson, D., Seneta, E.: Augmented truncations of infinite stochastic matrices. J. Appl. Probab. 24(3), 600–608 (1987)
Gibson, D., Seneta, E.: Monotone infinite stochastic matrices and their augmented truncations. Stoch. Process. Appl. 24(2), 287–292 (1987)
Grassmann, W.K., Taksar, M.I., Heyman, D.P.: Regenerative analysis and steady state distributions for Markov chains. Oper. Res. 33(5), 1107–1116 (1985)
Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)
Horváth, A., Telek, M.: Approximating heavy tailed behaviour with phase type distributions. In: 3rd International Conference on Matrix-Analytic Methods in Stochastic models, pp. 1–23. Leuven (2000)
Horváth, A., Telek, M.: Matching more than three moments with acyclic phase type distributions. Stoch. Models 23(2), 167–194 (2007)
Jiang, H., Wang, P., Zhuang, W.: A distributed channel access scheme with guaranteed priority and enhanced fairness. IEEE Trans. Wirel. Commun. 6(6), 2114–2125 (2007)
Kavitha, V., Hemachandra, N., Das, D.: Fairness via priority scheduling. In: 51st Annual Allerton Conference on Communication. Control, and Computing (Allerton), pp. 138–145. Monticello (2013)
Lee, D.S.: A two-queue model with exhaustive and limited service disciplines. Commun. Stat. Stoch. Models 12(2), 285–305 (1996)
Li, H., Zhao, Y.Q.: Stochastic block-monotonicity in the approximation of the stationary distribution of infinite Markov chains. Commun. Stat. Stoch. Models 16(2), 313–333 (2000)
Liu, Y.: Augmented truncation approximations of discrete-time Markov chains. Oper. Res. Lett. 38(3), 218–222 (2010)
Liu, Z., Chu, Y., Wu, J.: Heavy-traffic asymptotics of apriority polling system with threshold service policy. Comput. Oper. Res. 65, 19–28 (2016)
Lucantoni, D.M.: New results on the single server queue with a bath Markovian arrival process. Commun. Stat. Stoch. Models 7(1), 1–46 (1991)
Mack, C.: The efficiency of \(N\) machines uni-directionally patrolled by one operative when walking time is constant and repair times are variable. J. R. Stat. Soc. Ser. B Stat. Methodol. 19(1), 173–178 (1957)
Mack, C., Murphy, T., Webb, N.L.: The efficiency of \(N\) machines uni-directionally patrolled by one operative when walking time and repair times are constants. J. R. Stat. Soc. Ser. B Stat. Methodol. 19(1), 166–172 (1957)
Moustafa, M.D.: Input–output Markov process. Proc. k. Ned. Akad. Wet. Ser. A 60, 112–118 (1957)
Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore (1981)
Okamura, H., Dohi, T., Trivedi, K.S.: A refined EM algorithm for PH distributions. Perform. Eval. 68(10), 938–954 (2011)
Ramaswami, V.: The N/G/1 queue and its detailed analysis. Adv. Appl. Probab. 12(1), 222–261 (1980)
Reinecke, P., Krauß, T., Wolter, K.: Cluster-based fitting of phase-type distributions to empirical data. Comput. Math. Appl. 64(12), 3840–3851 (2012)
Saffer, Z., Telek, M.: Stability of periodic polling system with BMAP arrivals. Eur. J. Oper. Res. 197(1), 188–195 (2009)
Schmickler, L.: MEDA: mixed Erlang distributions as phase-type representations of empirical distribution functions. Commun. Stat. Stoch. Models 8(1), 131–156 (1992)
Sikha, M.B., Manivasakan, R.: A two-queue finite-buffer polling model with limited service and state-dependent service times. In: 2014 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), pp. 1–6. Bangalore (2014)
Telek, M., Heindl, A.: Matching moments for acyclic discrete and continuous phase-type distributions of second order. Int. J. Simul. Syst. Sci. Technol. 3(3–4), 47–57 (2002)
Thümmler, A., Buchholz, P., Telek, M.: A novel approach for phase-type fitting with the EM algorithm. IEEE Trans. Dependable Secur. Comput. 3(3), 245–258 (2006)
Vishnevsky, V.M., Dudin, A.N., Semenova, O.V., Klimenok, V.I.: Performance analysis of the BMAP/G/1 queue with gated servicing and adaptive vacations. Perform. Eval. 68(5), 446–462 (2011)
Wierman, A., Winands, E.M.M., Boxma, O.J.: Scheduling in polling systems. Perform. Eval. 64(9–12), 1009–1028 (2007)
Winands, E.M.M.: Polling, production & priorities. Ph.D. thesis, Eindhoven University of Technology, Eindhoven (2007)
Winands, E.M.M., Adan, I.J.B.F., van Houtum, G.J.J.A.N.: A two-queue model with alternating limited service and state-dependent setups. In: Analysis of Manufacturing Systems, Production Management, pp. 200–208. Zakynthos (2005)
Zhao, Y.Q., Liu, D.: The censored Markov chain and the best augmentation. J. Appl. Probab. 33(3), 623–629 (1996)
Acknowledgments
The authors thank the associate editor and reviewers for their invaluable comments and suggestions which lead to the considerable improvement of this paper. The research is supported by the National Natural Science Foundations of China (Grant Nos. 61271107 and 61401286).
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: The proof of Theorem 1
Proof
Without loss of generality, suppose \({S_n} = \left( {{i^{(1)}},{v^{(1)}},{i^{(2)}},{v^{(2)}}} \right) \in S\), and consider the state \({S_{n + 1}} = \left( {N_{n + 1}^{(1)},J_{n + 1}^{(1)},N_{n + 1}^{(2)},J_{n + 1}^{(2)}} \right) \). There are the relations \(N_{n + 1}^{(1)} = A_n^{(1)}\) and \(N_{n + 1}^{(2)} = {i^{(2)}} + A_n^{(2)} - C_n^{(2)}\), where \(A_n^{(k)}\) is a random variable which denotes the number of customers arriving at queue k during cycle n, and \(C_n^{(2)}\) is a random variable which denotes the number of 2-customers served (excluding the 2-customer whose service is interrupted) during the 2-service period in cycle n. \(C_n^{(2)}\) is determined by the state of the cyclic polling system at time \(TD_n^{(1)}\) in the stochastic sense, and the state of the cyclic polling system at time \(TD_n^{(1)}\) is determined by the state \({S_n} = \left( {{i^{(1)}},{v^{(1)}},{i^{(2)}},{v^{(2)}}} \right) \) in the stochastic sense independently of n. \(A_n^{(k)}\) and \(J_{n + 1}^{(k)}\) are determined by the cycle time of cycle n in the stochastic sense. The cycle time of cycle n is determined by the state \({S_n} = \left( {{i^{(1)}},{v^{(1)}},{i^{(2)}},{v^{(2)}}} \right) \) in the stochastic sense independently of n. Thus \(\left\{ {S_n}\right\} \) is a homogeneous Markov chain.
Under assumption A.2, given \(v_1 \in M_{1}\), \(v_2 \in M_{2}\), any state \(\left( {{i^{(1)}},{v^{(1)}},{i^{(2)}},{v^{(2)}}} \right) \in S\) can reach some state \(\left( i^{(1)}_1,v_1,i^{(2)}_1,v_2\right) \), since \({{\mathbf {D}}_1}\) and \({{\mathbf {D}}_2}\) are irreducible. Moreover, the state \(\left( {i_1^{(1)},v_1,i_1^{(2)},v_2} \right) \) can reach \(\left( 0,v_1,0,v_2\right) \), since \({{\mathbf {D}}_{1,0}}\) and \({{\mathbf {D}}_{2,0}}\) are stable. So the state \(\left( 0,v_1,0,v_2\right) \) can be reached from any state \(\left( {{i^{(1)}},{v^{(1)}},{i^{(2)}},{v^{(2)}}} \right) \in S\). From the above, there is a set C consisting of \(\left( 0,v_1,0,v_2\right) \) and the states which can be reached from the state \(\left( 0,v_1,0,v_2\right) \), such that C is absorbing and irreducible. Because \({{\mathbf {D}}_{1,0}}\) and \({{\mathbf {D}}_{2,0}}\) are stable, the state \(\left( 0,v_1,0,v_2\right) \) can be reached from itself by one-step transition. Thus all the states in C are aperiodic. Finally let \(D = S\backslash C\). Since any state in S can reach the state \(\left( 0,v_1,0,v_2\right) \in C\), if \(D \ne \emptyset \), then each state in D can reach C. The proof is complete. \(\square \)
Appendix 2: The proof of Theorem 2
Proof
Define the vector \({{\mathbf {X}}_i}\) by \({{\mathbf {X}}_i} = i{\mathbf {e}}\) \((i \in \mathrm{N})\). From the relation (8), if \({i_0} \in \mathrm{N}^+\) and \(i \in \left\{ {{i_0} + 1,{i_0} + 2, \ldots } \right\} \), then the left-hand side of the inequality (9) is equal to
Based on the relation (15) in [22], the following relation is obtained:
where \({{\mathbf {d}}_1} = \sum _{k = 1}^\infty {k{{\mathbf {D}}_{1,k}}{\mathbf {e}}}\). Using the relation (43), the relation (42) is transformed to,
Since \({{e}^{{{\mathbf {D}}_{1}}t}}=\sum \limits _{k=0}^{\infty }{\frac{{{\left( {{\mathbf {D}}_{1}}t \right) }^{k}}}{k!}}\), there is the following relation:
From the relation (3), it is shown that each element of \({e^{{{\mathbf {D}}_1}t}}\) is nonnegative. So from the relation (45), \({e^{{{\mathbf {D}}_1}t}}\) is a stochastic matrix for arbitrary \(t\ge 0\). Therefore, the supremum norm of \({e^{{{\mathbf {D}}_1}t}}\) is equal to 1, namely, \({\left\| {{e^{{{\mathbf {D}}_1}t}}} \right\| _\infty } = 1\). \({\left\| {\sum _{k = 0}^\infty {{h_k}{{\mathbf {P}}^{(1)}}(k,\tau )} } \right\| _\infty } \le {h_{\max }} < \infty \), since \(\sum _{k = 0}^\infty {{h_k}{{\mathbf {P}}^{(1)}}(k,\tau )}\le {h_{\max }}{e^{{{\mathbf {D}}_1}\tau }}\). \({\left\| {\sum _{k = 0}^\infty {{{\mathbf {P}}^{(1)}}(k,\tau )\int _{0}^\infty {{e^{{{\mathbf {D}}_1}x}}d{H_k}(x)}} } \right\| _\infty } = 1\), since \(\int _{0}^\infty {{e^{{{\mathbf {D}}_1}x}}d{H_k}(x)}{\mathbf {e}}={\mathbf {e}}\) and \(\sum _{k = 0}^\infty {{{\mathbf {P}}^{(1)}}(k,\tau )}{\mathbf {e}} = {\mathbf {e}}\). Thus, if i tends to infinity, then the sign of the expression (44) is identical to the sign of the expression \(\left( {{\rho _1} - 1} \right) \). If \({\rho _1} < 1\), then the left-hand side of (9) is negative for a sufficiently large i. From the relation (44), the inequality (10) is true for a finite i. The proof is complete. \(\square \)
Appendix 3: The proof of Lemma 1
Proof
Suppose that the initial state of \(\left\{ S'_n\right\} \) is \({S'_1} = ({i_1},{v_1}) \in D'\) \(({i_1} > 0)\) and \({S'_2} = ({i_2},{v_2})\) is reached from \(({i_1},{v_1})\) by one-step transition. From the relation (8), the transition probability from \(({i_1},{v_1})\) to \(({i_2},{v_2})\) is the \(({v_1},{v_2})\)-th element of the matrix \({{\mathbf {P}}_{{i_1}{i_2}}}\),
The transition probability from \((0,{v_1})\) to \(({i_2},{v_2})\) is the \(({v_1},{v_2})\)-th element of the matrix \({{\mathbf {P}}_{{0}{i_2}}}\),
It is shown that the relations (46) and (47) have similar structure. From (4), (5), (6), and (7), given a probability distribution G(t) on \([0, + \infty )\) with a positive and finite mean, the sign of each element of the matrix \(\int _{0}^\infty {{{\mathbf {P}}^{(1)}}(k,t)dG(t)}\), \(k \in \mathrm{N}\), depends only on \({{\mathbf {P}}^{(1)}}(k,t)\). Thus for \({{\mathbf {P}}_{{i_1}{i_2}}}\) and \({{\mathbf {P}}_{{0}{i_2}}}\), their elements at the same position have the same sign. So \({S'_2} = ({i_2},{v_2})\) can be reached from \((0,{v_1})\) by one-step transition with a positive probability. \({S'_2} = ({i_2},{v_2}) \in C'\), since \((0,v_1)\in C'\). The proof is complete. \(\square \)
Appendix 4: The proof of Corollary 1
Proof
From Lemma 5 of [30] and Corollary 3 of [35],
Substituting (48) into the right-hand side of the relation (17) yields
Based on the relations (16), (18), and (49), the formula for \(r_{\text {s}}^{(2)}\) can be written as the following:
By substituting the relation (50) into the relation \(\lambda _2<r_{\text {s}}^{(2)}\), the relation (24) can be obtained and it implies that \(\rho _1<1\) is true. The proof is complete. \(\square \)
Rights and permissions
About this article
Cite this article
Cao, J., Xie, W. Stability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplines. Queueing Syst 85, 117–147 (2017). https://doi.org/10.1007/s11134-016-9504-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-016-9504-z
Keywords
- Polling system
- Stability
- Batch Markovian arrival process
- Gated service
- State-dependent time-limited service
- Preemptive repeat different