Displaying similar documents to “Optimal QoS control of interacting service stations”

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...

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...

About the cumulative idle time in multiphase queues

Saulius Minkevičius, Stasys Steišūnas (2010)

RAIRO - Operations Research

Similarity:

The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems). Also we note that multiphase queueing systems can be useful for modelling practical multi-stage service systems in a variety of disciplines, especially on manufacturing (assembly lines), computer networking (packet switch structures), and in telecommunications ( cellular mobile networks),...

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...

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:

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 secondary job is interrupted abruptly and the server resumes...

Product form solution for g-networks with dependent service

Pavel Bocharov, Ciro D'Apice, Evgeny Gavrilov, Alexandre Pechinkin (2010)

RAIRO - Operations Research

Similarity:

We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: Negative customers arriving at each node also form a Poisson flow. A negative customer entering a node with customers in service, with probability chooses one of served...