APPROXIMATIONS TO PERFORMANCE MEASURES IN QUEUING SYSTEMS | Zendy

N.S. Kambo | Zendy; A. Rangan | Zendy; Ehsan MoghimiHadji | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

APPROXIMATIONS TO PERFORMANCE MEASURES IN QUEUING SYSTEMS

Author(s) -

N.S. Kambo,

A. Rangan,

Ehsan MoghimiHadji

Publication year - 2012

Publication title -

the south african journal of industrial engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.225

H-Index - 16

eISSN - 2224-7890

pISSN - 1012-277X

DOI - 10.7166/23-3-509

Subject(s) - queueing theory , parametric statistics , computer science , path (computing) , mathematical optimization , distribution (mathematics) , queue management system , mathematics , statistics , computer network , mathematical analysis

Approximations to various performance measures in queuing systems have received considerable attention because these measures have wide applicability. In this paper we propose two methods to approximate the queuing characteristics of a GI/M/1 system. The first method is non-parametric in nature, using only the first three moments of the arrival distribution. The second method treads the known path of approximating the arrival distribution by a mixture of two exponential distributions by matching the first three moments. Numerical examples and optimal analysis of performance measures of GI/M/1 queues are provided to illustrate the efficacy of the methods, and are compared with benchmark approximations

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research