Optimal Routing Problems and Multimodularity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1999

Optimal Routing Problems and Multimodularity


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.
Fichier principal
Vignette du fichier
RR-3727.pdf (327.87 Ko) Télécharger le fichier

Dates and versions

inria-00072937 , version 1 (24-05-2006)


  • HAL Id : inria-00072937 , version 1


Eitan Altman, Sandjai Bhulai, Bruno Gaujal, Arie Hordijk. Optimal Routing Problems and Multimodularity. RR-3727, INRIA. 1999. ⟨inria-00072937⟩
140 View
101 Download


Gmail Facebook Twitter LinkedIn More