scholarly journals Sensitivity Analysis and Simulation of a Multiserver Queueing System with Mixed Service Time Distribution

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1277
Author(s):  
Evsey Morozov ◽  
Michele Pagano ◽  
Irina Peshkova ◽  
Alexander Rumyantsev
Keyword(s):  
Service Time ◽  
Queueing System ◽  
Queueing Systems ◽  
Mixture Distribution ◽  
Service Time Distribution ◽  
Perfect Sampling ◽  
Mixing Distributions ◽  
Single Input ◽  
Theoretical Results ◽  
Multiserver Queueing System

The motivation of mixing distributions in communication/queueing systems modeling is that some input data (e.g., service time in queueing models) may follow several distinct distributions in a single input flow. In this paper, we study the sensitivity of performance measures on proximity of the service time distributions of a multiserver system model with two-component Pareto mixture distribution of service times. The theoretical results are illustrated by numerical simulation of the M/G/c systems while using the perfect sampling approach.

On extremal service disciplines in single-stage queueing systems

1990 ◽  
Vol 27 (02) ◽  
pp. 409-416 ◽  
Author(s):  
Rhonda Righter ◽  
J. George Shanthikumar ◽  
Genji Yamazaki
Keyword(s):  
Service Time ◽  
Sojourn Time ◽  
Queueing System ◽  
Residual Life ◽  
Queueing Systems ◽  
Mean Residual Life ◽  
Service Discipline ◽  
Service Time Distribution ◽  
Service Disciplines ◽  
Number Of Customers

It is shown that among all work-conserving service disciplines that are independent of the future history, the first-come-first-served (FCFS) service discipline minimizes [maximizes] the average sojourn time in a G/GI/1 queueing system with new better [worse] than used in expectation (NBUE[NWUE]) service time distribution. We prove this result using a new basic identity of G/GI/1 queues that may be of independent interest. Using a relationship between the workload and the number of customers in the system with different lengths of attained service it is shown that the average sojourn time is minimized [maximized] by the least-attained-service time (LAST) service discipline when the service time has the decreasing [increasing] mean residual life (DMRL[IMRL]) property.

On extremal service disciplines in single-stage queueing systems

1990 ◽  
Vol 27 (2) ◽  
pp. 409-416 ◽  
Author(s):  
Rhonda Righter ◽  
J. George Shanthikumar ◽  
Genji Yamazaki
Keyword(s):  
Service Time ◽  
Sojourn Time ◽  
Queueing System ◽  
Residual Life ◽  
Queueing Systems ◽  
Mean Residual Life ◽  
Service Discipline ◽  
Service Time Distribution ◽  
Service Disciplines ◽  
Number Of Customers

It is shown that among all work-conserving service disciplines that are independent of the future history, the first-come-first-served (FCFS) service discipline minimizes [maximizes] the average sojourn time in a G/GI/1 queueing system with new better [worse] than used in expectation (NBUE[NWUE]) service time distribution. We prove this result using a new basic identity of G/GI/1 queues that may be of independent interest. Using a relationship between the workload and the number of customers in the system with different lengths of attained service it is shown that the average sojourn time is minimized [maximized] by the least-attained-service time (LAST) service discipline when the service time has the decreasing [increasing] mean residual life (DMRL[IMRL]) property.

Stationary Poisson departure processes from non-stationary queues

1986 ◽  
Vol 23 (1) ◽  
pp. 256-260 ◽  
Author(s):  
Robert D. Foley
Keyword(s):  
Poisson Process ◽  
Service Time ◽  
Queueing Systems ◽  
Arrival Rate ◽  
Distribution Functions ◽  
Arrival Process ◽  
Service Time Distribution ◽  
Departure Process ◽  
Infinite Server ◽  
Departure Processes

We present some non-stationary infinite-server queueing systems with stationary Poisson departure processes. In Foley (1982), it was shown that the departure process from the Mt/Gt/∞ queue was a Poisson process, possibly non-stationary. The Mt/Gt/∞ queue is an infinite-server queue with a stationary or non-stationary Poisson arrival process and a general server in which the service time of a customer may depend upon the customer's arrival time. Mirasol (1963) pointed out that the departure process from the M/G/∞ queue is a stationary Poisson process. The question arose whether there are any other Mt/Gt/∞ queueing systems with stationary Poisson departure processes. For example, if the arrival rate is periodic, is it possible to select the service-time distribution functions to fluctuate in order to compensate for the fluctuations of the arrival rate? In this situation and in more general situations, it is possible to select the server such that the system yields a stationary Poisson departure process.

On a property of a refusals stream

1997 ◽  
Vol 34 (03) ◽  
pp. 800-805 ◽  
Author(s):  
Vyacheslav M. Abramov
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Busy Period ◽  
Elementary Proof ◽  
Queueing System ◽  
Queueing Systems ◽  
Single Server ◽  
Wide Family

This paper consists of two parts. The first part provides a more elementary proof of the asymptotic theorem of the refusals stream for an M/GI/1/n queueing system discussed in Abramov (1991a). The central property of the refusals stream discussed in the second part of this paper is that, if the expectations of interarrival and service time of an M/GI/1/n queueing system are equal to each other, then the expectation of the number of refusals during a busy period is equal to 1. This property is extended for a wide family of single-server queueing systems with refusals including, for example, queueing systems with bounded waiting time.

scholarly journals On the starshapeness of G/G/c queueing systems

1991 ◽  
Vol 23 (2) ◽  
pp. 431-435 ◽  
Author(s):  
J. George Shanthikumar ◽  
Couchen Wu
Keyword(s):  
Service Time ◽  
Queueing System ◽  
Queueing Systems ◽  
Single Stage ◽  
Sojourn Times ◽  
Optimal Service ◽  
The Mean

In this paper we show that the waiting and the sojourn times of a customer in a single-stage, multiple-server, G/G/c queueing system are increasing and starshaped with respect to the mean service time. Usefulness of this result in the design of the optimal service speed in the G/G/c queueing system is also demonstrated.

Some results on regular variation for distributions in queueing and fluctuation theory

1973 ◽  
Vol 10 (2) ◽  
pp. 343-353 ◽  
Author(s):  
J. W. Cohen
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Regular Variation ◽  
Time Distribution ◽  
Queueing System ◽  
Sufficient Conditions ◽  
Distribution Functions ◽  
Service Time Distribution ◽  
Virtual Waiting Time ◽  
Necessary And Sufficient

For the distribution functions of the stationary actual waiting time and of the stationary virtual waiting time of the GI/G/l queueing system it is shown that the tails vary regularly at infinity if and only if the tail of the service time distribution varies regularly at infinity.For sn the sum of n i.i.d. variables xi, i = 1, …, n it is shown that if E {x1} < 0 then the distribution of sup, s1s2, …] has a regularly varying tail at + ∞ if the tail of the distribution of x1 varies regularly at infinity and conversely, moreover varies regularly at + ∞.In the appendix a lemma and its proof are given providing necessary and sufficient conditions for regular variation of the tail of a compound Poisson distribution.

Insensitivity in queueing systems

1981 ◽  
Vol 13 (04) ◽  
pp. 846-859 ◽  
Author(s):  
David Y. Burman
Keyword(s):  
Stationary Distribution ◽  
Service Time ◽  
Stochastic Models ◽  
Time Distribution ◽  
Queueing Systems ◽  
Sufficient Conditions ◽  
Service Time Distribution ◽  
Flow Equations

It is well known that the stationary distribution of the number of busy servers in the Erlang blocking system (M/G/c/c) depends on the service-time distribution only through its mean. This insensitivity property is shared by several other queueing systems. In this paper, we give simple sufficient conditions for determining if this insensitivity property holds for general queueing systems and related stochastic models. The conditions involve determining whether the solution of the stationary Markovian flow equations also solves certain restricted flow equations. The proof that these conditions are sufficient is direct and elementary.

Sign in / Sign up

Export Citation Format

Share Document