Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T00:58:04.750Z Has data issue: false hasContentIssue false

Optimal QoS control of interacting service stations

Published online by Cambridge University Press:  15 April 2003

Abdelkrim Haqiq
Affiliation:
Faculté des Sciences et Techniques, Département de Mathématiques et Informatique, route de Casablanca, BP. 577, Settat, Maroc; haqiq@netscape.net.
I. Lambadaris
Affiliation:
Carleton University, Department of Systems and Computer Engineering, 1125 Colonel By Drive, Ottawa, Ontario, K1 S5 B6, Canada
N. Mikou
Affiliation:
Faculté des Sciences Mirande, Laboratoire Informatique de Recherche sur les Systèmes Intelligents et leurs Applications, BP. 47870, 21078 Dijon Cedex, France
L. Orozco–Barbosa
Affiliation:
University of Ottawa, School of Information, Technology and Engineering, 161 Louis Pasteur, Ottawa, Ontario, K1 N6 N5, Canada
Get access

Abstract

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 cost in the first queue. Subsequently, we generalize this problem by considering a system of (m+1) queues and n types of packets. We show that an optimal policy is monotonic.

Information

Type
Research Article
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable