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

Hongyuan Lu, Guodong Pang

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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 (α-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 M1 topology.

Original languageEnglish (US)
Pages (from-to)67-115
Number of pages49
JournalQueueing Systems
Volume85
Issue number1-2
DOIs
StatePublished - Feb 1 2017

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Heavy-traffic limits for an infinite-server fork–join queueing system with dependent and disruptive services'. Together they form a unique fingerprint.

Cite this