The M/M/1 queue with gated random order of service
暂无分享,去创建一个
[1] Augustus J. E. M. Janssen,et al. Analysis of contention tree algorithms , 2000, IEEE Trans. Inf. Theory.
[2] Philippe Flajolet,et al. Q -ary collision resolution algorithms in random-access systems with free or blocked channel access , 1985, IEEE Trans. Inf. Theory.
[3] O. J. Boxma,et al. The M/G/1 Queue with Permanent Customers , 1991, IEEE J. Sel. Areas Commun..
[4] Marcel F. Neuts,et al. A SERVICE SYSTEM WITH TWO STAGES OF WAITING AND FEEDBACK OF CUSTOMERS , 1984 .
[5] I. J. B. F. Adan,et al. A compensation approach for two-dimensional Markov processes , 1993, Advances in Applied Probability.