Evaluation of Pareto/D/1/k Queue by Simulation

The finding that Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to evaluate steady-state performance measures of Pareto/D/1/k queues. Some limited analytical derivation for queue models has been proposed in the literature, but their solutions are often of a great mathematical challenge. To overcome such limitations, simulation tools that can deal with general queueing system must be developed. Despite certain limitations, simulation algorithms provide a mechanism to obtain insight and good numerical approximation to parameters of queues. In this work, we give an overview of some of these methods and compare them with our simulation approach, which are suited to solve queues with Generalized-Pareto interarrival time distributions. The paper discusses the properties and use of the Pareto distribution. We propose a real time trace simulation model for estimating the steady-state probability showing the tail-raising effect, loss probability, delay of the Pareto/D/1/k queue and make a comparison with M/D/1/k. The background on Internet traffic will help to do the evaluation correctly. This model can be used to study the long- tailed queueing systems. We close the paper with some general comments and offer thoughts about future work.

Study of Queuing Systems with a Generalized Departure Process

This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005.

Generalized Scalarizing Problems GENS and GENSLex of Multicriteria Optimization

* This paper is partially supported by the National Science Fund of Bulgarian Ministry of Education and Science under contract № I–1401\2004 "Interactive Algorithms and Software Systems Supporting Multicriteria Decision Making".

Trimmed Likelihood Estimation of the Parameters of the Generalized Extreme Value Distributions: a Monte-Carlo Study

2000 Mathematics Subject Classification: Primary 62F35; Secondary 62P99

Generalized Priority Systems. Analytical Results and Numerical Algorithms

A class of priority systems with non-zero switching times, referred as generalized priority systems, is considered. Analytical results regarding the distribution of busy periods, queue lengths and various auxiliary characteristics are presented. These results can be viewed as generalizations of the Kendall functional equation and the Pollaczek-Khintchin transform equation, respectively. Numerical algorithms for systems’ busy periods and traffic coefficients are developed. ACM Computing Classification System (1998): 60K25.

A Generalized Quasi-Likelihood Estimator for Nonstationary Stochastic Processes−Asymptotic Properties and Examples

2010 Mathematics Subject Classification: 62F12, 62M05, 62M09, 62M10, 60G42.

On Estimation and Testing for Pareto Tails

2010 Mathematics Subject Classification: 62F10, 62F12.

On Generalized Models and Singular Products of Distributions in Colombeau Algebra G(R)

MSC 2010: 46F30, 46F10

Bayesian and Frequentist Two-Sample Predictions of the Inverse Weibull Model Based on Generalized Order Statistics

2000 Mathematics Subject Classification: 62E16,62F15, 62H12, 62M20.