On Estimates of Average Queue Length for Queueing Systems in The Case of Correlated Input Flow

2020 ◽  
Author(s):  
Igor Blatov ◽  
Boris Likhttsinder ◽  
Elena Kitaeva
Keyword(s):  
Queue Length ◽  
Queueing Systems ◽  
Input Flow

OPTIMIZATION OF MARKOV SYSTEMS OF QUEUEING WITH WAITING TIME IN THE MATLAB SYSTEM

2017 ◽  
pp. 39-47
Author(s):  
Viktor Afonin ◽  
Vladimir Valer'evich Nikulin
Keyword(s):  
Queueing System ◽  
Queueing Systems ◽  
Random Variable ◽  
Model Systems ◽  
Queuing Systems ◽  
Input Flow ◽  
Continuous Random Variable ◽  
Input Stream ◽  
Time Intervals ◽  
Markov Systems

The article focuses on attempt to optimize two well-known Markov systems of queueing: a multichannel queueing system with finite storage, and a multichannel queueing system with limited queue time. In the Markov queuing systems, the intensity of the input stream of requests (requirements, calls, customers, demands) is subject to the Poisson law of the probability distribution of the number of applications in the stream; the intensity of service, as well as the intensity of leaving the application queue is subject to exponential distribution. In a Poisson flow, the time intervals between requirements are subject to the exponential law of a continuous random variable. In the context of Markov queueing systems, there have been obtained significant results, which are expressed in the form of analytical dependencies. These dependencies are used for setting up and numerical solution of the problem stated. The probability of failure in service is taken as a task function; it should be minimized and depends on the intensity of input flow of requests, on the intensity of service, and on the intensity of requests leaving the queue. This, in turn, allows to calculate the maximum relative throughput of a given queuing system. The mentioned algorithm was realized in MATLAB system. The results obtained in the form of descriptive algorithms can be used for testing queueing model systems during peak (unchanged) loads.

Filtering of Markov renewal queues, IV: Flow processes in feedback queues

1985 ◽  
Vol 17 (2) ◽  
pp. 386-407 ◽  
Author(s):  
Jeffrey J. Hunter
Keyword(s):  
Queue Length ◽  
Queueing Systems ◽  
Arrival Process ◽  
Markov Renewal Process ◽  
Renewal Processes ◽  
Flow Process ◽  
Special Cases ◽  
Flow Processes ◽  
Transition Points ◽  
The Times

This paper is a continuation of the study of a class of queueing systems where the queue-length process embedded at basic transition points, which consist of ‘arrivals’, ‘departures’ and ‘feedbacks’, is a Markov renewal process (MRP). The filtering procedure of Çinlar (1969) was used in [12] to show that the queue length process embedded separately at ‘arrivals’, ‘departures’, ‘feedbacks’, ‘inputs’ (arrivals and feedbacks), ‘outputs’ (departures and feedbacks) and ‘external’ transitions (arrivals and departures) are also MRP. In this paper expressions for the elements of each Markov renewal kernel are derived, and thence expressions for the distribution of the times between transitions, under stationary conditions, are found for each of the above flow processes. In particular, it is shown that the inter-event distributions for the arrival process and the departure process are the same, with an equivalent result holding for inputs and outputs. Further, expressions for the stationary joint distributions of successive intervals between events in each flow process are derived and interconnections, using the concept of reversed Markov renewal processes, are explored. Conditions under which any of the flow processes are renewal processes or, more particularly, Poisson processes are also investigated. Special cases including, in particular, the M/M/1/N and M/M/1 model with instantaneous Bernoulli feedback, are examined.

Multichannel Queueing Systems with Regenerative Input Flow

2014 ◽  
Vol 58 (2) ◽  
pp. 174-192 ◽  
Author(s):  
L. G. Afanasyeva ◽  
A. V. Tkachenko
Keyword(s):  
Queueing Systems ◽  
Input Flow ◽  
Regenerative Input

Controlled queues in heavy traffic

1975 ◽  
Vol 7 (3) ◽  
pp. 656-671 ◽  
Author(s):  
John H. Rath
Keyword(s):  
Diffusion Process ◽  
Queue Length ◽  
Queueing System ◽  
Systems Approach ◽  
Heavy Traffic ◽  
Queueing Systems ◽  
Control Policy ◽  
Controlled Diffusion ◽  
Controlled Queues

This paper studies a controlled queueing system in which the decisionmaker may change servers according to rules which depend only on the queue length. It is proved that for a given control policy a properly normalised sequence of these controlled queue length processes converges weakly to a controlled diffusion process as the queueing systems approach a state of heavy traffic.

Controlled queues in heavy traffic

1975 ◽  
Vol 7 (03) ◽  
pp. 656-671 ◽  
Author(s):  
John H. Rath
Keyword(s):  
Diffusion Process ◽  
Queue Length ◽  
Queueing System ◽  
Systems Approach ◽  
Heavy Traffic ◽  
Queueing Systems ◽  
Control Policy ◽  
Controlled Diffusion ◽  
Controlled Queues

This paper studies a controlled queueing system in which the decisionmaker may change servers according to rules which depend only on the queue length. It is proved that for a given control policy a properly normalised sequence of these controlled queue length processes converges weakly to a controlled diffusion process as the queueing systems approach a state of heavy traffic.

Subdiffusive Load Balancing in Time-Varying Queueing Systems

2019 ◽  
Vol 67 (6) ◽  
pp. 1678-1698
Author(s):  
Rami Atar ◽  
Isaac Keslassy ◽  
Gal Mendelson
Keyword(s):  
Load Balancing ◽  
Queue Length ◽  
Queueing Systems ◽  
Load Condition ◽  
Service Rates ◽  
Queue Lengths ◽  
Join The Shortest Queue ◽  
The Difference ◽  
Shortest Queue ◽  
Diffusion Scale

The degree to which delays or queue lengths equalize under load-balancing algorithms gives a good indication of their performance. Some of the most well-known results in this context are concerned with the asymptotic behavior of the delay or queue length at the diffusion scale under a critical load condition, where arrival and service rates do not vary with time. For example, under the join-the-shortest-queue policy, the queue length deviation process, defined as the difference between the greatest and smallest queue length as it varies over time, is at a smaller scale (subdiffusive) than that of queue lengths (diffusive).

Response times in M/M/s fork-join networks

2004 ◽  
Vol 36 (3) ◽  
pp. 854-871 ◽  
Author(s):  
Sung-Seok Ko ◽  
Richard F. Serfozo
Keyword(s):  
Response Time ◽  
Poisson Process ◽  
Closed Form ◽  
Queue Length ◽  
Response Times ◽  
Statistical Tests ◽  
Queueing Systems ◽  
Kolmogorov Smirnov ◽  
Processing Network ◽  
Closed Form Formula

We study a fork-join processing network in which jobs arrive according to a Poisson process and each job splits into m tasks, which are simultaneously assigned to m nodes that operate like M/M/s queueing systems. When all of its tasks are finished, the job is completed. The main result is a closed-form formula for approximating the distribution of the network's response time (the time to complete a job) in equilibrium. We also present an analogous approximation for the distribution of the equilibrium queue length (the number of jobs in the system), when each node has one server. Kolmogorov-Smirnov statistical tests show that these formulae are good fits for the distributions obtained from simulations.

scholarly journals Asymptotic analysis of a queueing system by a two-dimensional state space

1984 ◽  
Vol 21 (4) ◽  
pp. 870-886 ◽  
Author(s):  
J. P. C. Blanc
Keyword(s):  
Asymptotic Analysis ◽  
Queue Length ◽  
Queueing System ◽  
Queueing Systems ◽  
Length Distribution ◽  
Time Dependent ◽  
Queue Length Distribution ◽  
Long Run ◽  
Dimensional State Space ◽  
Hilbert Type

A technique is developed for the analysis of the asymptotic behaviour in the long run of queueing systems with two waiting lines. The generating function of the time-dependent joint queue-length distribution is obtained with the aid of the theory of boundary value problems of the Riemann–Hilbert type and by introducing a conformal mapping of the unit disk onto a given domain. In the asymptotic analysis an extensive use is made of theorems on the boundary behaviour of such conformal mappings.

Sign in / Sign up

Export Citation Format

Share Document