A Random Tandem Network with Queues Modeled as Birth-Death Processes
2018We consider a tandem network consisting of an arbitrary but finite number \(R_m\) of queueing systems, where \(R_m\) is a discrete random variable with a suitable probability distribution. Each queueing system of the tandem network is modeled via a birth-death process and consists of an infinite buffer space and of a service center with a single server.
Virginia Giorno, Amelia G. Nobile
openaire +1 more source
On two node tandem queueing model with time dependent service rates
International Journal of System Assurance Engineering and Management, 2018Queueing is a phenomenon associated with congestion. For controlling congestion and to utilize the resources optimally the queueing models are developed. In queueing models, it is customary to consider that the arrival and service processes are stable and follows a Poisson process. But in many systems the service process is time dependent and it can be
K. Srinivasa Rao, J. Durga Aparajitha
openaire +2 more sources
A tandem queueing model of a time-sharing computing system
Proceedings of the ACM annual conference on - ACM '72, 1972This paper presents a cyclic tandem queueing model of a time-shared computer system. An input/output subsystem, to process paging and file handling requests, is placed in tandem with a central processor which works on jobs for random time periods between interrupts.
openaire +1 more source
A cyclic service tandem queueing model with parallel queues in the first stage
Communications in Statistics. Stochastic Models, 1988This paper presents an analysis for the steady state of a two-stage tandem queueing model served by a single server, in which the first stage has two queues in parallel. Generating functions are obtained for two joint queue length distributions, one at the instant just after service completion and the other at an arbitrary instant, using a solution of ...
openaire +1 more source
Blocking Probabilities for a Class of Two-Station Tandem Queueing Models
IIE Transactions, 1991Abstract We study a two-station tandem queueing system with a finite buffer of maximum size M (M≥0) between the stations. The first service station has L≥1(homogeneous) parallel servers with an unlimited waiting space, while at the second there are N≥1 (homogeneous) parallel servers.
GEORGE TSIOTRAS +2 more
openaire +1 more source
A diffusion model for two tandem queues with general renewal input
Communications in Statistics. Stochastic Models, 1999Two tandem queues with exponential servers are considered. Arrivals to the first queue are governed by a general renewal process. If the arrivals were also exponentially distributed, this would be a simple example of a Jackson network. However, the structure of the model is more complicated for general arrivals.
Knessl, Charles, Tier, Charles
openaire +2 more sources
Priority tandem queueing system with retrials and reservation of channels as a model of call center
Computers & Industrial Engineering, 2016A tandem queue consisting of two multi-server stations is analyzed.Retrials and impatience of customers are taken into account.Ergodicity condition is derived.Steady state distribution of the system states and performance measures are computed.Numerical results showing significant effect of providing the priority are presented.
Che Soong Kim +2 more
openaire +1 more source
On a tandem queueing model with identical service times at both counters, II
Advances in Applied Probability, 1979This paper is devoted to the practical implications of the theoretical results obtained in Part I [1] for queueing systems consisting of two single-server queues in series in which the service times of an arbitrary customer at both queues are identical. For this purpose some tables and graphs are included.
openaire +1 more source
Two Tandem Queues with General Renewal Input II: Asymptotic Expansions for the Diffusion Model
SIAM Journal on Applied Mathematics, 1999Summary: In Part I (announced above) we formulated and solved a diffusion model for two tandem queues with exponential servers and general renewal arrivals. We thus obtained the heavy traffic diffusion approximation to the steady state joint queue length distribution for this network.
Charles Knessl, Charles Tier
openaire +2 more sources
Optimal Capacities of Tokens at Tandem-Queue Models of General Service Times
Quality Technology & Quantitative Management, 2005We consider a queueing system with two stations in series. Assume the service time distributions are general at one station and a finite mixture of Erlang distributions at the other. Exogenous customers should snatch tokens at a token buffer of finite capacity in order to enter the system.
Luh,Hsing, Huang,Chun-Lian
openaire +1 more source

