Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants
暂无分享,去创建一个
[1] Hisashi Kobayashi,et al. Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..
[2] Simon S. Lam. Behavior of the normalization constant and a scaling technique for product-form queueing networks , 1980, Perform. Evaluation.
[3] Simon S. Lam,et al. A Tree Convolution Algorithm for Queueing Networks , 1981 .
[4] Simon S. Lam,et al. An Analysis of the Tree Convolution Algorithm , 1981 .
[5] K. Mani Chandy,et al. Computational algorithms for product form queueing networks , 1980 .
[6] K. Mani Chandy,et al. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.
[7] G. Gilbert. Referencing as Persuasion , 1977 .
[8] Donald F. Towsley,et al. Product Form and Local Balance in Queueing Networks , 1977, JACM.
[9] P BuzenJeffrey. Computational algorithms for closed queueing networks with exponential servers , 1973 .
[10] S. S. Lavenberg,et al. Work Rates in Closed Queuing Networks with General Independent Servers , 1974, Oper. Res..
[11] Stephen S. Lavenberg,et al. Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.
[12] Simon S. Lam,et al. Queuing Networks with Population Size Constraints , 1977, IBM J. Res. Dev..
[13] Luke Y.-C. Lien,et al. A tree convolution algorithm for the solution of queueing networks , 1983, CACM.