Skip to main content
SpringerLink
Log in

Heavy-traffic limits for an infinite-server fork–join queueing system with dependent and disruptive services

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study an infinite-server fork–join queueing system with dependent services, which experiences alternating renewal service disruptions. Jobs are forked into a fixed number of parallel tasks upon arrival and processed at the corresponding parallel service stations with multiple servers. Synchronization of a job occurs when its parallel tasks are completed, i.e., non-exchangeable. Service times of the parallel tasks of each job can be correlated, having a general continuous joint distribution function, and moreover, the service vectors of consecutive jobs form a stationary dependent sequence satisfying the strong mixing (\(\alpha \)-mixing) condition. The system experiences renewal alternating service disruptions with up and down periods. In each up period, the system operates normally, but in each down period, jobs continue to enter the system, while all the servers will stop working, and services received will be conserved and resume at the beginning of the next up period. We study the impact of both the dependence among service times and these down times upon the service dynamics, the unsynchronized queueing dynamics, and the synchronized process, assuming that the down times are asymptotically negligible. We prove FWLLN and FCLT for these processes, where the limit processes in the FCLT possess a stochastic decomposition property and the convergence requires the Skorohod \(M_1\) topology.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Abdel-Hameed, M.: Lévy Processes and Their Applications in Reliability and Storage. Springer, Berlin (2014)

    Book  Google Scholar 

  2. Applebaum, D.: Lévy Processes and Stochastic Calculus. Cambridge University Press, Cambridge (2009)

    Book  Google Scholar 

  3. Atar, R., Mandelbaum, A., Zviran, A.: Control of fork–join networks in heavy traffic. In: 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE (2012)

  4. Bickel, P.J., Wichura, M.J.: Convergence criteria for multiparameter stochastic processes and some applications. Ann. Math. Stat. 42, 1656–1670 (1971)

    Article  Google Scholar 

  5. Billingsley, P.: Convergence of Probability Measures. Wiley, New York (2009)

    Google Scholar 

  6. Brémaud, P.: Point Processes and Queues. Springer, New York (1981)

    Book  Google Scholar 

  7. Bücher, A.: A note on weak convergence of the sequential multivariate empirical process under strong mixing. J. Theor. Prob. 28(3), 1028–1037 (2015). doi:10.1007/s10959-013-0529-5

    Article  Google Scholar 

  8. Chen, H., Whitt, W.: Diffusion approximations for open queueing networks with service interruptions. Queueing Syst. 13, 335–359 (1993)

    Article  Google Scholar 

  9. Dai, H.: Exact Monte Carlo simulation for fork–join networks. Adv. Appl. Prob. 43(2), 484–503 (2011)

    Article  Google Scholar 

  10. Davydov, Y.A.: Convergence of distributions generated by stationary stochastic process. Theory Prob. Appl. 13(4), 691–696 (1968)

    Article  Google Scholar 

  11. Durrett, R.: Probability: Theory and Examples. Cambridge University Press, Cambridge (2010)

    Book  Google Scholar 

  12. Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence. Wiley, New York (2009)

    Google Scholar 

  13. Gurvich, I., Ward, A.: On the dynamic control of matching queues. Stoch. Syst. 4(2), 479–523 (2014)

    Article  Google Scholar 

  14. Ivanoff, B.G.: The function space D (\([0,\infty )^q\), E). Can. J. Stat. 8(2), 179–191 (1980)

    Article  Google Scholar 

  15. Jacod, J., Shiryaev, A.N.: Limit Theorems for Stochastic Processes. Springer, Berlin (1987)

    Book  Google Scholar 

  16. Jayawardene, A.K., Kella, O.: \(M/G/\infty \) with alternating renewal breakdowns. Queueing Syst. 22(1–2), 79–95

  17. Kella, O., Whitt, W.: Diffusion approximations for queues with server vacations. Adv. Appl. Prob. 22, 706–729 (1990)

    Article  Google Scholar 

  18. Kella, O., Whitt, W.: Queues with server vacations and Lévy processes with secondary jump input. Ann. Appl. Prob. 1, 104–117 (1991)

    Article  Google Scholar 

  19. Ko, S.S., Serfozo, R.F.: Response times in \(M/M/s\) fork–join networks. Adv. Appl. Prob. 36(3), 854–871 (2004)

    Google Scholar 

  20. Ko, S.S., Serfozo, R.F.: Sojourn times in \(G/M/1\) fork–join networks. Nav. Res. Logist. 55(5), 432–443 (2008)

    Article  Google Scholar 

  21. Krichagina, E.V., Puhalskii, A.A.: A heavy-traffic analysis of a closed queueing system with a \(GI/\infty \) service center. Queueing Syst. 25(1–4), 235–280 (1997)

    Article  Google Scholar 

  22. Kyprianou, A.E.: Introductory Lectures on Fluctuations of Lévy Processes with Applications. Springer, Berlin (2006)

    Google Scholar 

  23. Liptser, R.S., Shiryaev, A.N.: Theory of Martingales. Kluwer, Dordrecht (1989)

    Book  Google Scholar 

  24. Lu, H., Pang, G.: Gaussian limits of a fork–join network with non-exchangeable synchronization in heavy-traffic. Math. Oper. Res. 41(2), 560–595 (2016)

    Article  Google Scholar 

  25. Lu, H., Pang, G.: Heavy-traffic limits for a fork–join network in the Halfin–Whitt regime (2015) (under review)

  26. Lu, H., Pang, G., Zhou, Y.: \(G/GI/N(+GI)\) queues with service interruptions in the Halfin–Whitt regime. Math. Methods Oper. Res. 83(1), 127–160 (2016)

    Article  Google Scholar 

  27. Neuhaus, G.: On weak convergence of stochastic processes with multidimensional time parameter. Ann. Math. Stat. 42(4), 1285–1295 (1971)

    Article  Google Scholar 

  28. Nguyen, V.: Processing networks with parallel and sequential tasks: heavy traffic analysis and Brownian limits. Ann. Appl. Prob. 3(1), 28–55 (1993)

    Article  Google Scholar 

  29. Nguyen, V.: The trouble with diversity: fork–join networks with heterogeneous customer population. Ann. Appl. Prob. 4(1), 1–25 (1994)

    Article  Google Scholar 

  30. Olvera-Cravioto, M., Ruiz-Lacedelli, O.: Parallel queues with synchronization (2015) (preprint)

  31. Özkan, E., Ward, A.R.: On the control of fork–join networks (2015) (preprint)

  32. Pang, G., Whitt, W.: Service interruptions in large-scale service systems. Manag. Sci. 55, 1499–1512 (2009a)

    Article  Google Scholar 

  33. Pang, G., Whitt, W.: Heavy-traffic limits for many-server queues with service interruptions. Queueing Syst. 61, 167–202 (2009b)

    Article  Google Scholar 

  34. Pang, G., Whitt, W.: Two-parameter heavy-traffic limits for infinite-server queues. Queueing Syst. 65(4), 325–364 (2010)

    Article  Google Scholar 

  35. Pang, G., Whitt, W.: Two-parameter heavy-traffic limits for infinite-server queues with dependent service times. Queueing Syst. 73, 119–146 (2013)

    Article  Google Scholar 

  36. Pang, G., Zhou, Y.: \(G/G/\infty \) queues with renewal alternating interruptions. Adv. Appl. Prob. (2016)

  37. Pang, G., Zhou, Y.: Two-parameter process limits for an infinite-server queue with arrival dependent services. Stoch. Process. Appl. (2016)

  38. Sklar, M.: Fonctions de répartition à n dimensions et leurs marges. Publ. Inst. Statist. Univ, Paris (1959)

  39. Straf, M.L.: Weak convergence of stochastic processes with several parameters. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, vol. 2, pp. 187–221 (1972)

  40. Varma, S.: Heavy and light traffic approximations for queues with synchronization constraints. Ph.D. Thesis (1990)

  41. Whitt, W.: Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York (2002)

    Google Scholar 

  42. Zaied, I.: The offered load in fork–join networks: calculations and applications to service engineering of emergency department. M.Sc. Research Thesis. Technion, Haifa (2012)

  43. Zviran, A.: Fork–join networks in heavy traffic: diffusion approximations and control. M.Sc. Research Thesis. Technion, Haifa (2011)

Download references

Acknowledgements

The authors thank the associate editor and referees very much for the valuable and constructive comments that have helped improve the results and presentation of the article substantially. The authors also thank Yuhang Zhou for helpful discussions. This work is supported in part by the NSF Grant CMMI-1538149.

Author information

Authors and Affiliations

  1. The Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, College of Engineering, Pennsylvania State University, University Park, PA, 16802, USA

    Hongyuan Lu & Guodong Pang

Authors
  1. Hongyuan Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guodong Pang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guodong Pang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lu, H., Pang, G. Heavy-traffic limits for an infinite-server fork–join queueing system with dependent and disruptive services. Queueing Syst 85, 67–115 (2017). https://doi.org/10.1007/s11134-016-9505-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-016-9505-y

Keywords

Mathematics Subject Classification

Search

Navigation