On the relationship between work load and waiting time in single server queues with batch inputs
暂无分享,去创建一个
[1] A. Hawkes. Time-Dependent Solution of a Priority Queue with Bulk Arrival , 1965 .
[2] R. Wolff. Work-conserving priorities , 1970 .
[3] J. Little. A Proof for the Queuing Formula: L = λW , 1961 .
[4] P. J. Burke. Technical Note - Delays in Single-Server Queues with Batch Input , 1975, Oper. Res..
[5] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..
[6] P. Tran-Gia,et al. Analysis of a Finite Storage System with Batch Input Arising out of Message Packetization , 1982, IEEE Trans. Commun..
[7] Linus Schrage. Letter to the Editor - An Alternative Proof of a Conservation Law for the Queue G/G/1 , 1970, Oper. Res..
[8] S. Brumelle. On the relation between customer and time averages in queues , 1971 .
[9] V. Schmidt,et al. The stationary waiting time process in single-server priority queues with general low priority arrival process , 1984 .
[10] W. Whitt. Comparing batch delays and customer delays , 1983, The Bell System Technical Journal.
[11] Yutaka Takahashi,et al. Diffusion Approximation for a Token Ring System with Nonexhausive Service , 1986, IEEE J. Sel. Areas Commun..
[12] J. Doob. Stochastic processes , 1953 .
[13] Charles D. Flagle. Letter to the Editor---Conference on Operational Research in the Health Services of Great Britain , 1961 .
[14] Dietrich Stoyan,et al. Stochastic processes with imbedded marked point processes (pmp) and thcir application in queneing , 1978 .
[15] L. Kleinrock. A conservation law for a wide class of queueing disciplines , 1965 .