The heavy-traffic bottleneck phenomenon in open queueing networks
暂无分享,去创建一个
Ward Whitt | S. Suresh | W. Whitt | S. Suresh
[1] W. Whitt. Approximations for departure processes and queues in series , 1984 .
[2] Wolfgang Kraemer,et al. Approximate Formulae for the Delay in the Queueing System GI/G/ 1 , 1976 .
[3] Hong Chen,et al. Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .
[4] Martin I. Reiman,et al. Some diffusion approximations with state space collapse , 1984 .
[5] Ward Whitt,et al. Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..
[6] Sheng-Roan Kai,et al. Approximation for the departure process of a queue in a network , 1986 .
[7] Ward Whitt,et al. The Best Order for Queues in Series , 1985 .
[8] W. Whitt. Planning queueing simulations , 1989 .
[9] Ward Whitt,et al. A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues , 1988 .
[10] Susan L. Albin,et al. Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues , 1984, Oper. Res..
[11] W. Whitt,et al. The Queueing Network Analyzer , 1983, The Bell System Technical Journal.
[12] Martin I. Reiman,et al. Asymptotically exact decomposition approximations for open queueing networks , 1990 .
[13] D. Iglehart,et al. Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.
[14] Martin I. Reiman,et al. Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..
[15] W. Whitt. Comparing counting processes and queues , 1981, Advances in Applied Probability.
[16] Ward Whitt,et al. A Queueing Network Analyzer for Manufacturing , 1989 .
[17] Ward Whitt,et al. Arranging Queues in Series: A Simulation Experiment , 1990 .