INTERPOLATION APPROXIMATIONS FOR THE MEAN WAITING TIME IN A MULTI-SERVER QUEUE

Interpolation Approximations for the Mean Waiting Time in a Multi-server Queue

This paper gives numerical validation of a couple of interpolation approximations for the mean waiting time in a Cl/C/s queue, which are provided by a unified approach similar to that in Kimura (1991). Both approximations are represented as certain combinations of the mean waiting times for the Cl/M/5 and Cl / D / 5 queues in which the arrival processes and the mean service times are the same a...

متن کامل

Approximations for the mean sojourn time in a parallel queue

This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...

متن کامل

Approximations for the mean sojourn time in a parallel queue

This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...

متن کامل

Approximations for the mean sojourn time in a parallel queue

This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...

متن کامل

Approximations for the mean sojourn time in a parallel queue

This paper considers a parallel queue, which is two-queue network, where any arrival generates a job at both queues. The focus is on methods to quantify the mean value of the `system's sojourn time' S: with Si denoting a job's sojourn time in queue i, S is defined as max(S1; S2). It is noted that earlier work has revealed that this class of models is notoriously hard to analyze. We first evalua...

متن کامل

INTERPOLATION APPROXIMATIONS FOR THE MEAN WAITING TIME IN A MULTI-SERVER QUEUE

نویسندگان

چکیده

منابع مشابه