By Topic

Optimal admission, routing and service assignment control: the case of single buffer queues

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
E. Altman ; Inst. Nat. de Recherche en Inf. et Autom., Sophia-Antipolis ; B. Gaujal ; A. Hordijk ; G. Koole

We consider the problem of optimal routing of arriving packets into N servers having no waiting room. Packets that are routed to a busy server are lost. We consider two problems where the objective is to maximize the expected throughput (or equivalently, minimize the loss rate). We assume that the controller has no information on the state of the server. We establish the optimality of the so called “balanced” policies, for exponential service times and general stationary arrival processes, which include, in particular, the interrupted Poisson process, Markov modulated Poisson Process and Markov arrival process. Based on this solution, we solve the dual problem of optimal assignment of a single server to several single server queues to which packets arrive according to Poisson processes. This general model is then applied to solve an optimal scheduling problem for robots of Web search engines

Published in:

Decision and Control, 1998. Proceedings of the 37th IEEE Conference on  (Volume:2 )

Date of Conference:

16-18 Dec 1998