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

被引:0
|
作者
Hongyuan Lu
Guodong Pang
机构
[1] Pennsylvania State University,The Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, College of Engineering
来源
Queueing Systems | 2017年 / 85卷
关键词
Infinite-server fork–join queue; Non-exchangeable synchronization; Multiparameter sequential empirical process with strong mixing (; -mixing) random vectors; (Generalized) multiparameter Kiefer processes; Service disruptions/interruptions; Skorohod ; topology; 60K25; 60F17; 90B22; 60J75; 54A20;
D O I
暂无
中图分类号
学科分类号
摘要
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 (α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}-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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_1$$\end{document} topology.
引用
收藏
页码:67 / 115
页数:48
相关论文
共 43 条