The solution of separable queueing network models using mean value analysis
暂无分享,去创建一个
[1] H. Kobayashi,et al. On the convolution algorithm for separable queuing networks , 1976, SIGMETRICS '76.
[2] K. Mani Chandy,et al. Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..
[3] Isi Mitrani,et al. The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.
[4] Herb Schwetman,et al. Implementing the Mean Value Algorithm for the Solution of Queueing Network Models , 1980 .
[5] K. Mani Chandy,et al. Computational algorithms for product form queueing networks , 1980, Performance.
[6] J. Little. A Proof for the Queuing Formula: L = λW , 1961 .
[7] Peter J. Denning,et al. The Operational Analysis of Queueing Network Models , 1978, CSUR.
[8] Stephen S. Lavenberg,et al. Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.
[9] S. C. Bruell,et al. On single and multiple job class queueing network models of computer systems. , 1978 .
[10] K. Mani Chandy,et al. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.
[11] John Zahorjan,et al. The approximate solution of large queueing network models , 1980 .
[12] Jeffrey P. Buzen,et al. Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.