Displaying similar documents to “A paradox in a queueing network with state-dependent routing and loss.”

Analysis of operating characteristics for the heterogeneous batch arrival queue with server startup and breakdowns

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

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when N units are accumulated in the system and off when the system is empty. We model this system by an M [ x ] /M/1 queue with server breakdowns and startup time under the N 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...

A unified cost function for M/G/1 queueing systems with removable server.

Jesús R. Artalejo (1992)

Trabajos de Investigación Operativa

Similarity:

This article deals with the three classic policies for an M/G/1 queueing system (N, T, and D-policy). The optimum policies were compared in several precedent studies, but the comparison was performed employing different cost functions, so that the D-policy is superior to the N-policy when the cost function is based on the mean work-load, whilst the average queue length is used to show the superiority of the N-policy over the T-policy. In order to achieve a comparison of the three policies...

Optimal QoS control of interacting service stations

Abdelkrim Haqiq, I. Lambadaris, N. Mikou, L. Orozco-Barbosa (2002)

RAIRO - Operations Research - Recherche Opérationnelle

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

Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes

Olga V. Semenova (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A single-server queueing system with a batch markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.