Results 1 to 10 of about 1,330 (109)

Upper bound for the decay rate of the joint queue-length distribution in a two-node Markovian queueing system [PDF]

open access: yesQueueing Systems, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ken'ichi Katou   +2 more
exaly   +3 more sources

Analysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival Streams [PDF]

open access: yesStochastic Models, 2003
This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of customers may be different for different arrival streams.
Hiroyuki Masuyama, Tetsuya Takine
exaly   +3 more sources

Joint distribution of sojourn time and queue length in the M/G/1 queue with (in) finite capacity

open access: yesEuropean Journal of Operational Research, 1984
For the M/G/1 queue we study the joint distribution of the number of customers x present immediately before an arrival epoch and of the residual service time ¿ of the customer in service at this epoch. The correlation coefficient (x, ¿) is shown to be positive (negative) when the service time distribution is DFR (IFR).
exaly   +5 more sources

The effect of Retrial Rate on the M/G/1 Retrial Queueing System [PDF]

open access: yesMaǧallaẗ Al-Buḥūṯ Al-Tiǧāriyyaẗ, 2020
In this paper, we consider the main model of M/G/I retrial queueing system. We will introduce the previous model with some important properties that affect the retrial system state. Also, the joint distribution of the server state and the length of queue
محمد حسن حسن
doaj   +1 more source

Joint Queue-Length Distribution for the Non-Preemptive Multi-Server Multi-Level Markovian Priority Queue

open access: yesQueueing Systems, 2023
<p>Explicit results are obtained using simple and exact methods for the joint queue-length distribution of the M/M/c queue with an arbitrary number of non-preemptive priority levels. This work is the first to provide explicit results for the joint probability generating function and joint probability mass function for a general number of priority
Josef Zuk, David Kirszenblat
openaire   +2 more sources

Joint queue length distribution of multi-class, single-server queues with preemptive priorities [PDF]

open access: yesQueueing Systems, 2015
In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a multi-dimensional Markov process, where the coordinates keep track of the number of customers of each class in the system ...
Andrei Sleptchenko   +3 more
openaire   +2 more sources

Queueing Systems with Random Volume Customers and a Sectorized Unlimited Memory Buffer

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2021
In the present paper, we concentrate on basic concepts connected with the theory of queueing systems with random volume customers and a sectorized unlimited memory buffer.
Tikhonenko Oleg   +2 more
doaj   +1 more source

Analysis of a Retrial Queue With Two-Type Breakdowns and Delayed Repairs

open access: yesIEEE Access, 2020
This article studies an M/G/1 retrial queue with two types of breakdowns. When the server is idle, it is subject to breakdowns according to a Poisson process with rate δ and it cannot be repaired immediately.
Shan Gao, Jie Zhang, Xianchao Wang
doaj   +1 more source

Performance Analysis of a Polling Model With BMAP and Across-Queue State-Dependent Service Discipline

open access: yesIEEE Access, 2019
As various video services become popular, video streaming will dominate the mobile data traffic. The H.264 standard has been widely used for video compression.
Jianyu Cao   +4 more
doaj   +1 more source

An Analytical Approximation of the Joint Distribution of Aggregate Queue-Lengths in an Urban Network

open access: yesProcedia - Social and Behavioral Sciences, 2012
AbstractTraditional queueing network models assume infinite queue capacities due to the complexity of capturing interactions between finite capacity queues. Accounting for this correlation can help explain how congestion propagates through a network. Joint queue-length distribution can be accurately estimated through simulation. Nonetheless, simulation
Wang, Carter, Osorio Pizano, Carolina
openaire   +3 more sources

Home - About - Disclaimer - Privacy