论文信息 - Loss probability behavior of Pareto/M/1/K queue

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

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.

Kiseon Kim | Younsuk Koh

[1] Anja Feldmann,et al. Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network , 1998, Perform. Evaluation.

[2] 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..

[3] Masakiyo Miyazawa,et al. Complementary generating functions for the MX/GI/1/k and GI/My/1/K queues and their application to the comparison of loss probabilities , 1990, Journal of Applied Probability.

[4] Walter Willinger,et al. On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[5] J. Gordon,et al. Pareto process as a model of self-similar packet traffic , 1995, Proceedings of GLOBECOM '95.

[6] Carl M. Harris,et al. Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis , 2000, INFORMS J. Comput..

[7] Gunter Bolch,et al. Queueing Networks and Markov Chains - Modeling and Performance Evaluation with Computer Science Applications, Second Edition , 1998 .

[8] Anja Feldmann,et al. Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

[9] Sally Floyd,et al. Wide area traffic: the failure of Poisson modeling , 1995, TNET.