Loss probability behavior of Pareto/M/1/K queue

被引:20
作者
Koh, Y [1 ]
Kim, K [1 ]
机构
[1] Kwangju Inst Sci & Technol, Dept Informat & Commun, Gwangju 500712, South Korea
关键词
decay factor; GI/M/1/K; loss probability; ParetO/M/I/K; transform approximation method;
D O I
10.1109/LCOMM.2002.806469
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In this letter, we investigate the,queue behavior with. Pareto interarrival and exponential service time distribution. By numerical analysis and simulations, we analyze the asymptotic and the exact loss probabilities of GI/M/1/K to show the big discrepancy between the asymptotic and the actual loss probability and propose a model for the loss probability of Pareto/M/1/K as a function of the buffer size K and the geometric parameter.
引用
收藏
页码:39 / 41
页数:3
相关论文
共 9 条
[1]  
[Anonymous], IEEE ACM T NET
[2]  
Bolch Gunter, 1998, Queueing Networks and Markov Chains: Modeling and Performance Evaluation With Computer Science Applications
[3]   Asymptotic behavior of loss probability in GI/M/1/K queue as K tends to infinity [J].
Choi, BD ;
Kim, B ;
Wee, IS .
QUEUEING SYSTEMS, 2000, 36 (04) :437-442
[4]   Fitting mixtures of exponentials to long-tail distributions to analyze network performance models [J].
Feldmann, A ;
Whitt, W .
PERFORMANCE EVALUATION, 1998, 31 (3-4) :245-279
[5]  
GORDON J, 1995, P GLOBECOM 95 NOV, V3, P2232
[6]   Internet-type queues with power-tailed interarrival times and computational methods for their analysis [J].
Harris, CM ;
Brill, PH ;
Fischer, MJ .
INFORMS JOURNAL ON COMPUTING, 2000, 12 (04) :261-271
[7]   ON THE SELF-SIMILAR NATURE OF ETHERNET TRAFFIC (EXTENDED VERSION) [J].
LELAND, WE ;
TAQQU, MS ;
WILLINGER, W ;
WILSON, DV .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1994, 2 (01) :1-15
[9]  
SCHWEFEL HP, 1999, P 3 IFIP WORKSH TRAF