Application of decomposition principle in M/G/1 vacation model to two continuum cyclic queueing models — Especially token-ring LANs
暂无分享,去创建一个
[1] Robert B. Cooper. Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..
[2] S. Halfin. An approximate method for calculating delays for a family of cyclic-type queues , 1975, The Bell System Technical Journal.
[3] Izhak Rubin,et al. Analysis and Comparison of Message Queueing Delays in Token-Rings and Token-Buses Local Area Networks , 1984, ICC.
[4] P. J. Kuehn,et al. Multiqueue systems with nonexhaustive cyclic service , 1979, The Bell System Technical Journal.
[5] Hideaki Takagi,et al. Analysis of polling systems , 1986 .
[6] Robert B. Cooper,et al. Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..
[7] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..
[8] Werner Bux,et al. Performance Issues in Local-Area Networks , 1984, IBM Syst. J..
[9] Bernd Meister,et al. Waiting Lines and Times in a System with Polling , 1974, JACM.
[10] G. Boyd Swartz. Polling in a Loop System , 1980, JACM.
[11] Martin Eisenberg,et al. Queues with Periodic Service and Changeover Time , 1972, Oper. Res..
[12] W. Bux. Local-Area Subnetworks: A Performance Comparison , 1981, IEEE Trans. Commun..
[13] R. R. P. Jackson. Introduction to Queueing Theory , 1943 .
[14] Steven Nahmias,et al. Stochastic Models of Internal Mail Delivery Systems , 1984 .
[15] Robert B. Cooper,et al. Queues served in cyclic order , 1969 .