Asymptotic analysis of loss probability in a finite queue where one packet occupies as many places as its length
暂无分享,去创建一个
Bara Kim | Bong Dae Choi | In-Suk Wee | Jeongsim Kim | Jeongsim Kim | Bara Kim | B. Choi | In-Suk Wee
[1] Vinod Sharma,et al. A finite buffer queue with priorities , 2002, Perform. Evaluation.
[2] Andrea Baiocchi,et al. Asymptotic behaviour of the loss probability of theM/G/1/K andG/M/1/K queues , 1992, Queueing Syst. Theory Appl..
[3] Nicola Blefari-Melazzi,et al. Analysis of the loss probability of the map/g/1/k queue part ii: approximations and numerical results , 1994 .
[4] Hideaki Takagi,et al. Queueing analysis: a foundation of performance evaluation , 1993 .
[5] Jeffrey J. Hunter,et al. Mathematical techniques of applied probability , 1985 .
[6] Ronald W. Wolff,et al. Stochastic Modeling and the Theory of Queues , 1989 .
[7] Andrea Baiocchi,et al. Analysis of the loss probability of the map/g/1/k queue part i: asymptotic theory , 1994 .
[8] Jeffrey J. Hunter. Discrete Time Models : Techniques and Applications , 1983 .
[9] Henk C. Tijms,et al. A Two-Moment Approximation for a Buffer Design Problem Requiring a Small Rejection Probability , 1985, Perform. Evaluation.
[10] Egbert Falkenberg,et al. On the asymptotic behaviour of the stationary distribution of Markov chains of M/G/1-type , 1994 .
[11] Bara Kim,et al. Asymptotic Behavior of Loss Probability in GI/M/1/K Queue as K Tends to Infinity , 2000, Queueing Syst. Theory Appl..