Computational schemes for two exponential servers where the first has a finite buffer

Moshe Haviv; Rita Zlotnikov

Displaying similar documents to “Computational schemes for two exponential servers where the first has a finite buffer”

The MX/M/1 queue with working breakdown

Zaiming Liu, Yang Song (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, we consider a batch arrival //1 queue model with working breakdown. The server may be subject to a service breakdown when it is busy, rather than completely stoping service, it will decrease its service rate. For this model, we analyze a two-dimensional Markov chain and give its quasi upper triangle transition probability matrix. Under the system stability condition, we derive the probability generating function (PGF) of the stationary queue length, and...

An MX/G/1 unreliable retrial queue with two phase service and persistence behaviour of customers in service

M. Senthil Kumar, R. Arumuganathan (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper describes an unreliable server batch arrival retrial queue with two types of repair and second optional service. The server provides preliminary first essential service (FES) to the primary arriving customers or customers from retrial group. On successful completion of FES, the customer may opt for second optional service (SOS) with probability . The server is subject to active break downs. The customer under FES (or SOS) during the failure decides, with probability , to join...

Analysis of Operating Characteristics for the Heterogeneous Batch Arrival Queue with Server Startup and Breakdowns

Jau-Chuan Ke, Kuo-Hsiung Wang (2010)

RAIRO - Operations Research

Similarity:

In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on ( begins startup) when units are accumulated in the system and off when the system is empty. We model this system by an M/M/1 queue with server breakdowns and startup time under the policy. The arrival rate varies according to the server's status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according to...

Analysis of a M/G(a,b)/1 queueing system with vacation interruption

M. Haridass, R. Arumuganathan (2012)

RAIRO - Operations Research

Similarity:

In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘’ customers waiting for service say , he serves a batch of min (, b) customers, where ≥ . On the other hand, if the queue length is at the most ‘-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the...

Analysis of a MX/G(a,b)/1 queueing system with vacation interruption

M. Haridass, R. Arumuganathan (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Restricted Admissibility of Batches into an //1 Type Bulk Queue with Modified Bernoulli Schedule Server Vacations

Kailash C. Madan, Walid Abu–Dayyeh (2010)

ESAIM: Probability and Statistics

Similarity:

We investigate the steady state behavior of an //1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various...

Computational schemes for two exponential servers where the first has a finite buffer

Moshe Haviv, Rita Zlotnikov (2011)

RAIRO - Operations Research

Similarity:

We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold . Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [ (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process...

A discrete-time Geo/G/1 retrial queue with general retrial time and M-additional options for service

Muthukrishnan Senthil Kumar (2011)

RAIRO - Operations Research

Similarity:

This paper concerns a discrete time Geo/G/1 retrial queue with general retrial time in which all the arriving customers require first essential service with probability $α_{0}$ while only some of them demand one of other optional services: − ( = 1, 2, 3,...) service with probability $α_{r}$ . The system state distribution, the orbit size and the system size distributions are obtained in terms of generating functions. The stochastic decomposition law holds for the proposed model. Performance...

A discrete-time Geo/G/1 retrial queue with general retrial time and M-additional options for service

Muthukrishnan Senthil Kumar (2011)

RAIRO - Operations Research

Similarity:

Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies

Yuliya Gaidamaka, Alexander Pechinkin, Rostislav Razumchik, Konstantin Samouylov, Eduard Sopin (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system $M^{[X]} | G | 1 ⟨ L, H ⟩ | ⟨ H, R ⟩$ with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s...