Open Access
2011 Lévy-driven polling systems and continuous-state branching processes
Onno Boxma, Jevgenijs Ivanovs, Kamil Kosiński, Michel Mandjes
Stoch. Syst. 1(2): 411-436 (2011). DOI: 10.1214/10-SSY008
Abstract

In this paper we consider a ring of $N\ge 1$ queues served by a single server in a cyclic order. After having served a queue (according to a service discipline that may vary from queue to queue), there is a switch-over period and then the server serves the next queue and so forth. This model is known in the literature as a polling model.

Each of the queues is fed by a non-decreasing Lévy process, which can be different during each of the consecutive periods within the server’s cycle. The $N$-dimensional Lévy processes obtained in this fashion are described by their (joint) Laplace exponent, thus allowing for non-independent input streams. For such a system we derive the steady-state distribution of the joint workload at embedded epochs, i.e. polling and switching instants. Using the Kella-Whitt martingale, we also derive the steady-state distribution at an arbitrary epoch.

Our analysis heavily relies on establishing a link between fluid (Lévy input) polling systems and multi-type Jiřina processes (continuous-state discrete-time branching processes). This is done by properly defining the notion of the branching property for a discipline, which can be traced back to Fuhrmann and Resing. This definition is broad enough to contain the most important service disciplines, like exhaustive and gated.

References

1.

[1] J. Abate and W. Whitt. Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comp., 7:36–43, 1995.[1] J. Abate and W. Whitt. Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comp., 7:36–43, 1995.

2.

[2] J. Abate and W. Whitt. A unified framework for numerically inverting Laplace transforms. INFORMS J. Comput., 18:408–421, 2006. MR2274708 10.1287/ijoc.1050.0137[2] J. Abate and W. Whitt. A unified framework for numerically inverting Laplace transforms. INFORMS J. Comput., 18:408–421, 2006. MR2274708 10.1287/ijoc.1050.0137

3.

[3] E. Altman. Stochastic recursive equations with applications to queues with dependent vacations. Annals of Operations Research, 112:43–61, 2002. MR1960670 10.1023/A:1020972803727[3] E. Altman. Stochastic recursive equations with applications to queues with dependent vacations. Annals of Operations Research, 112:43–61, 2002. MR1960670 10.1023/A:1020972803727

4.

[4] E. Altman and D. Fiems. Expected waiting time in symmetric polling systems with correlated walking times. Queueing Syst., 56:241–253, 2007. MR2336110 10.1007/s11134-007-9039-4[4] E. Altman and D. Fiems. Expected waiting time in symmetric polling systems with correlated walking times. Queueing Syst., 56:241–253, 2007. MR2336110 10.1007/s11134-007-9039-4

5.

[5] S. Asmussen. Applied Probability and Queues. Springer, 2nd edition, 2002. MR1978607[5] S. Asmussen. Applied Probability and Queues. Springer, 2nd edition, 2002. MR1978607

6.

[6] O.J. Boxma. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Syst., 5:185–214, 1989. MR1032554 10.1007/BF01149192[6] O.J. Boxma. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Syst., 5:185–214, 1989. MR1032554 10.1007/BF01149192

7.

[7] O.J. Boxma. Polling systems. In K. Apt, A. Schrijver, and N. Temme, editors, Liber Amicorum for P.C. Baayen., pages 215–230. CWI, Amsterdam, 1994. MR1490592[7] O.J. Boxma. Polling systems. In K. Apt, A. Schrijver, and N. Temme, editors, Liber Amicorum for P.C. Baayen., pages 215–230. CWI, Amsterdam, 1994. MR1490592

8.

[8] O.J. Boxma, H. Levy, and U. Yechiali. Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Ann. Oper. Res., 35:187–208, 1992.[8] O.J. Boxma, H. Levy, and U. Yechiali. Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Ann. Oper. Res., 35:187–208, 1992.

9.

[9] O.J. Boxma, Q. Deng, and J.A.C. Resing. Polling systems with regularly varying service and/or switchover times. Adv. Perf. Anal., 3:71–107, 2000.[9] O.J. Boxma, Q. Deng, and J.A.C. Resing. Polling systems with regularly varying service and/or switchover times. Adv. Perf. Anal., 3:71–107, 2000.

10.

[10] O.J. Boxma, M. Mandjes, and O. Kella. On a queueing model with service interruptions. Probab. Engrg. Infor. Sci., 22:537–555, 2008. MR2452336 10.1017/S0269964808000326[10] O.J. Boxma, M. Mandjes, and O. Kella. On a queueing model with service interruptions. Probab. Engrg. Infor. Sci., 22:537–555, 2008. MR2452336 10.1017/S0269964808000326

11.

[11] G.L. Choudhury and W. Whitt. Computing distributions and moments in polling models by numerical transform inversion. Performance Evaluation, 25:267–292, 1996.[11] G.L. Choudhury and W. Whitt. Computing distributions and moments in polling models by numerical transform inversion. Performance Evaluation, 25:267–292, 1996.

12.

[12] O. Czerniak and U. Yechiali. Fluid polling systems. Queueing Syst., 63:401–435, 2009. MR2576020 10.1007/s11134-009-9129-6[12] O. Czerniak and U. Yechiali. Fluid polling systems. Queueing Syst., 63:401–435, 2009. MR2576020 10.1007/s11134-009-9129-6

13.

[13] I. Eliazar. Gated polling systems with Lévy inflow and inter-dependent switchover times: a dynamical systems approach. Queueing Syst., 49:49–72, 2005. MR2119657 10.1007/s11134-004-5555-7[13] I. Eliazar. Gated polling systems with Lévy inflow and inter-dependent switchover times: a dynamical systems approach. Queueing Syst., 49:49–72, 2005. MR2119657 10.1007/s11134-004-5555-7

14.

[14] S.W. Fuhrmann. Performance analysis of a class of cyclic schedules. Technical Report 81-59531-1., Bell Laboratories, 1981.[14] S.W. Fuhrmann. Performance analysis of a class of cyclic schedules. Technical Report 81-59531-1., Bell Laboratories, 1981.

15.

[15] S.W. Fuhrmann. A decomposition result for a class of polling models. Queueing Syst., 11:109–120, 1992. MR1178645 10.1007/BF01159290[15] S.W. Fuhrmann. A decomposition result for a class of polling models. Queueing Syst., 11:109–120, 1992. MR1178645 10.1007/BF01159290

16.

[16] M. Jiřina. Stochastic branching processes with continuous state space. Czechosl. Math. J., 8:292–313, 1958. MR101554[16] M. Jiřina. Stochastic branching processes with continuous state space. Czechosl. Math. J., 8:292–313, 1958. MR101554

17.

[17] O. Kella and W. Whitt. Useful martingales for stochastic storage processes with Lévy input. J. Appl. Probab., 29:396–403, 1992. MR1165224 10.2307/3214576[17] O. Kella and W. Whitt. Useful martingales for stochastic storage processes with Lévy input. J. Appl. Probab., 29:396–403, 1992. MR1165224 10.2307/3214576

18.

[18] A.E. Kyprianou. Introductory Lectures on Fluctuations of Lévy Processes with Applications. Springer-Verlag, Berlin Heidelberg, 2006. MR2250061[18] A.E. Kyprianou. Introductory Lectures on Fluctuations of Lévy Processes with Applications. Springer-Verlag, Berlin Heidelberg, 2006. MR2250061

19.

[19] H. Levy and M. Sidi. Polling systems with correlated arrivals. In Technology: Emerging or Converging, IEEE, volume 3 of Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies, pages 907–913. INFOCOM ’89, 1989.[19] H. Levy and M. Sidi. Polling systems with correlated arrivals. In Technology: Emerging or Converging, IEEE, volume 3 of Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies, pages 907–913. INFOCOM ’89, 1989.

20.

[20] H. Levy and M. Sidi. Polling models: applications, modeling and optimization. IEEE Trans. Commun., 38:1750–1760, 1990.[20] H. Levy and M. Sidi. Polling models: applications, modeling and optimization. IEEE Trans. Commun., 38:1750–1760, 1990.

21.

[21] A.G. Pakes. Some limit theorems for Jiřina processes. Period. Math. Hungar., 1:55–66, 1979. MR494544 10.1007/BF02018373[21] A.G. Pakes. Some limit theorems for Jiřina processes. Period. Math. Hungar., 1:55–66, 1979. MR494544 10.1007/BF02018373

22.

[22] N.U. Prabhu. Stochastic Storage Processes: Queues, Insurance Risk, Dams, and Data Communication. Springer-Verlag, New York, 2nd edition, 1998. MR1492990[22] N.U. Prabhu. Stochastic Storage Processes: Queues, Insurance Risk, Dams, and Data Communication. Springer-Verlag, New York, 2nd edition, 1998. MR1492990

23.

[23] J.A.C. Resing. Polling systems and multitype branching processes. Queueing Syst., 13:409–426, 1993. MR1231052 10.1007/BF01149263[23] J.A.C. Resing. Polling systems and multitype branching processes. Queueing Syst., 13:409–426, 1993. MR1231052 10.1007/BF01149263

24.

[24] K. Sato. Lévy Processes and Infinitely Divisible Distributions, volume 68 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1999.[24] K. Sato. Lévy Processes and Infinitely Divisible Distributions, volume 68 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1999.

25.

[25] E. Seneta. Non-negative Matrices and Markov Chains. Springer-Verlag, New York, 2nd edition, 1981. MR2209438[25] E. Seneta. Non-negative Matrices and Markov Chains. Springer-Verlag, New York, 2nd edition, 1981. MR2209438

26.

[26] E. Seneta and D. Vere-Jones. On the asymptotic behaviour of subcritical branching processes with continuous state space. Z. Wahrscheinlichkeitstheorie verw. Geb., 10: 212–225, 1968. MR239667 10.1007/BF00536275[26] E. Seneta and D. Vere-Jones. On the asymptotic behaviour of subcritical branching processes with continuous state space. Z. Wahrscheinlichkeitstheorie verw. Geb., 10: 212–225, 1968. MR239667 10.1007/BF00536275

27.

[27] E. Seneta and D. Vere-Jones. On a problem of M. Jiřina concerning continuous state branching processes. Czechosl. Math. J., 19:277–283, 1969. MR246379[27] E. Seneta and D. Vere-Jones. On a problem of M. Jiřina concerning continuous state branching processes. Czechosl. Math. J., 19:277–283, 1969. MR246379

28.

[28] H. Takagi. Queueing Analysis, volume 1. North-Holland, Amsterdam, 1991b.[28] H. Takagi. Queueing Analysis, volume 1. North-Holland, Amsterdam, 1991b.

29.

[29] H. Takagi. Application of polling models to computer networks. Comput. Netw. ISDN Syst., 22:193–211, 1991a.[29] H. Takagi. Application of polling models to computer networks. Comput. Netw. ISDN Syst., 22:193–211, 1991a.

30.

[30] H. Takagi. Analysis and application of polling models. In G. Haring, C. Lindemann, and M. Reiser, editors, Performance Evaluation: Origins and Directions, volume 1769 of Lecture Notes in Computer Science, pages 423–442. Springer, Berlin, 2000.[30] H. Takagi. Analysis and application of polling models. In G. Haring, C. Lindemann, and M. Reiser, editors, Performance Evaluation: Origins and Directions, volume 1769 of Lecture Notes in Computer Science, pages 423–442. Springer, Berlin, 2000.

31.

[31] V.M. Vishnevskii and O.V. Semenove. Mathematical methods to study the polling systems. Autom. Remote Control, 67:173–220, 2006. MR2210457[31] V.M. Vishnevskii and O.V. Semenove. Mathematical methods to study the polling systems. Autom. Remote Control, 67:173–220, 2006. MR2210457

32.

[32] W. Whitt. Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer-Verlag, 2002. MR1876437[32] W. Whitt. Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer-Verlag, 2002. MR1876437
Copyright © 2011 INFORMS Applied Probability Society
Onno Boxma, Jevgenijs Ivanovs, Kamil Kosiński, and Michel Mandjes "Lévy-driven polling systems and continuous-state branching processes," Stochastic Systems 1(2), 411-436, (2011). https://doi.org/10.1214/10-SSY008
Published: 2011
Vol.1 • No. 2 • 2011
Back to Top