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

被引:8
|
作者
Lu, Hongyuan [1 ]
Pang, Guodong [1 ]
机构
[1] Penn State Univ, Harold & Inge Marcus Dept Ind & Mfg Engn, Coll Engn, University Pk, PA 16802 USA
基金
美国国家科学基金会;
关键词
Infinite-server fork-join queue; Non-exchangeable synchronization; Multiparameter sequential empirical process with strong mixing (alpha-mixing); STOCHASTIC-PROCESSES; WEAK-CONVERGENCE; QUEUES; TIMES;
D O I
10.1007/s11134-016-9505-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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 topology.
引用
收藏
页码:67 / 115
页数:49
相关论文
共 16 条