In Network of Queues, M/M/1 Can Outperform M/D/1
暂无分享,去创建一个
[1] K. Mani Chandy,et al. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.
[2] S. Ross. Average delay in queues with non-stationary Poisson arrivals , 1978, Journal of Applied Probability.
[3] Ward Whitt,et al. The effect of variability in the GI/G/s queue , 1980, Journal of Applied Probability.
[4] John N. Tsitsiklis,et al. The efficiency of greedy routing in hypercubes and butterflies , 1991, SPAA '91.
[5] W. Whitt. Comparison conjectures about the M/G/ s queue , 1983 .
[6] Wushow Chou,et al. Queueing Systems, Volume II: Computer Applications - Leonard Kleinrock , 1977, IEEE Transactions on Communications.
[7] Ward Whitt,et al. Minimizing Delays in the GI/G/1 Queue , 1984, Oper. Res..
[8] Frank Kelly,et al. Networks of queues with customers of different types , 1975, Journal of Applied Probability.
[9] Ronald W Wolff,et al. The Effect of Service Time Regularity on System Performance. , 1977 .
[10] Jean C. Walrand,et al. An introduction to queueing networks , 1989, Prentice Hall International editions.
[11] John A. Buzacott,et al. Stochastic models of manufacturing systems , 1993 .
[12] Debasis Mitra,et al. Randomized Parallel Communications , 1986, ICPP.
[13] Mor Harchol-Balter,et al. Queueing analysis of oblivious packet-routing networks , 1994, SODA '94.
[14] Bruce Hajek,et al. Delay and Routing in Interconnection Networks , 1987 .
[15] Sheldon M. Ross,et al. Introduction to probability models , 1975 .