Transient characteristics of an M/M/∞ system
暂无分享,去创建一个
[1] Henry C. Thacher,et al. Applied and Computational Complex Analysis. , 1988 .
[2] Christopher J. Van Wyk,et al. A Queueing Analysis of Hashing with Lazy Deletion , 1987, SIAM J. Comput..
[3] G. Rubino,et al. Sojourn times in finite Markov processes , 1989, Journal of Applied Probability.
[4] Fabrice Guillemin,et al. Transient analysis of statistical multiplexing on an ATM link , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.
[5] R. A. Silverman,et al. Special functions and their applications , 1966 .
[6] A. A. Borovkov,et al. Asymptotic Methods in Queueing Theory. , 1986 .
[7] Julian Keilson,et al. The matrix M/M/∞ system: retrial models and Markov modulated sources , 1993 .
[8] A. Shiryaev,et al. Limit Theorems for Stochastic Processes , 1987 .
[9] Leonard Kleinrock,et al. Queueing Systems - Vol. 1: Theory , 1975 .
[10] T. MacRobert. Higher Transcendental Functions , 1955, Nature.
[11] R. Syski,et al. Introduction to congestion theory in telephone systems , 1962 .
[12] P. Billingsley,et al. Convergence of Probability Measures , 1970, The Mathematical Gazette.
[13] A. Erdélyi,et al. Higher Transcendental Functions , 1954 .
[14] F. Baccelli,et al. Palm Probabilities and Stationary Queues , 1987 .
[15] D. Aldous. Probability Approximations via the Poisson Clumping Heuristic , 1988 .