Computing performance measures in a multi-class multi-resource processor-shared loss system
暂无分享,去创建一个
[1] D. Mitra. Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking , 1987, Advances in Applied Probability.
[2] Hisashi Kobayashi,et al. Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..
[3] Paul Bratley,et al. A guide to simulation , 1983 .
[4] K. G. Ramakrishnan,et al. A class of closed Markovian queuing networks: integral representations, asymptotic expansions, and generalizations , 1981 .
[5] J. Kaufman,et al. Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..
[6] Jeffrey P. Buzen,et al. Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.
[7] Luke Y.-C. Lien,et al. A tree convolution algorithm for the solution of queueing networks , 1983, CACM.
[8] Jie Wang,et al. Monte Carlo summation and integration applied to multiclass queuing networks , 1994, JACM.
[9] Keith W. Ross,et al. Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .
[10] Nico M. van Dijk,et al. Monotonicity of Performance Measures in a Processor Sharing Queue , 1991, Perform. Evaluation.
[11] Keith W. Ross,et al. Monte Carlo Summation Applied to Product-Form Loss Networks , 1992, Probability in the Engineering and Informational Sciences.
[12] Keith W. Ross,et al. Algorithms to determine exact blocking probabilities for multirate tree networks , 1990, IEEE Trans. Commun..