Displaying similar documents to “ Product form solution for g-networks with dependent service ”

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

Optimal QoS control of interacting service stations

Abdelkrim Haqiq, I. Lambadaris, N. Mikou, L. Orozco–Barbosa (2010)

RAIRO - Operations Research

Similarity:

We consider a system of three queues and two types of packets. Each packet arriving at this system finds in front of it a controller who either sends it in the first queue or rejects it according to a QoS criterion. When the packet finishes its service in the first queue, it is probabilistically routed to one of two other parallel queues. The objective is to minimize a QoS discounted cost over an infinite horizon. The cost function is composed of a waiting cost per packet in each queue...

Product form solution for g-networks with dependent service

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

RAIRO - Operations Research - Recherche Opérationnelle

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: (0) an exponential node with c n servers, infinite buffer and FIFO discipline; (1) an infinite-server node; (2) a single-server node with infinite buffer and LIFO PR discipline; (3) a...

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

Fluid limits for the queue length of jobs in multiserver open queueing networks

Saulius Minkevičius (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The object of this research in the queueing theory is a theorem about the Strong-Law-of-Large-Numbers (SLLN) under the conditions of heavy traffic in a multiserver open queueing network. SLLN is known as a fluid limit or fluid approximation. In this work, we prove that the long-term average rate of growth of the queue length process of a multiserver open queueing network under heavy traffic strongly converges to a particular vector of rates. SLLN is proved for the values of an important...

Study of Queuing Systems with a Generalized Departure Process

Mirtchev, Seferin, Statev, Stanimir (2008)

Serdica Journal of Computing

Similarity:

This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005. This paper deals with a full accessibility loss system and a single server delay system with a Poisson arrival process and state dependent exponentially distributed service time. We use the generalized service flow with nonlinear state dependence mean service time. The idea is based on the analytical continuation of the Binomial distribution and the classic M/M/n/0 and M/M/1/k system....