Open-Loop routing to M parallel servers with no buffer

Eitan Altman 1 Sandjai Bhulai Bruno Gaujal 2 Arie Hordijk
2 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study the static assignment of packets to M parallel heterogeneous servers with no buffers. Blocked packets are lost and the objective is to minimize the average number of lost packets. The paper is divided into three parts. In the first part we formulate the problem as a Markov Decision Problem with partial observation and we derive an equivalent full observation problem. From this full observation problem we derive some structural results. We establish, in particular, the existence of an optimal periodic policy. The second part of the paper deals with computational aspects of the problem. We use multimodularity to derive an algorithm to compute optimal policies and show that for two servers the cost function is multimodular. In the third part we consider the same problem with well known arrival processes, such as the Poisson Process, the Markov Modulated Poisson Process and the Markovian Arrival Process.
Type de document :
Article dans une revue
Journal of Applied Probability, Applied Probability Trust, 2000, 37 (3), pp.668-684
Liste complète des métadonnées

https://hal.inria.fr/inria-00099122
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:51:07
Dernière modification le : samedi 27 janvier 2018 - 01:30:41

Identifiants

  • HAL Id : inria-00099122, version 1

Collections

Citation

Eitan Altman, Sandjai Bhulai, Bruno Gaujal, Arie Hordijk. Open-Loop routing to M parallel servers with no buffer. Journal of Applied Probability, Applied Probability Trust, 2000, 37 (3), pp.668-684. 〈inria-00099122〉

Partager

Métriques

Consultations de la notice

231