Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

Contrôle dynamique de flux dans un système d'attente avec panne

A. HaqiqN. Mikou — 2010

RAIRO - Operations Research

We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths.

Optimal QoS control of interacting service stations

Abdelkrim HaqiqI. LambadarisN. MikouL. Orozco-Barbosa — 2002

RAIRO - Operations Research - Recherche Opérationnelle

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 and a rejection...

Optimal QoS control of interacting service stations

Abdelkrim HaqiqI. LambadarisN. MikouL. Orozco–Barbosa — 2010

RAIRO - Operations Research

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 and a rejection...

Page 1

Download Results (CSV)