Flow control using the theory of zero sum Markov games - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1992

Flow control using the theory of zero sum Markov games

Résumé

We consider the problem of dynamic flow control of arriving pacquets into an infinite buffer. The service rate may depend on the state of the system, may change in time and is unknown to the controller. The goal of the controller is to design an efficient policy which guarantees the best performance under the worst case service conditions. The cost is composed of a holding cost, a cost for rejecting customers (packets) and a cost that depends on the quality of the service. The problem is studied in the framework of zero-sum Markov games and a value iteration algorithm is used to solve it. We show that there exists an optimal stationary policy (such that the decisions depend only on the actual number of customers in the queue) ; it is of a threshold type, and it uses randomization in at most one state.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-1597.pdf (202.11 Ko) Télécharger le fichier

Dates et versions

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

Identifiants

  • HAL Id : inria-00074963 , version 1

Citer

Eitan Altman. Flow control using the theory of zero sum Markov games. [Research Report] RR-1597, INRIA. 1992, pp.17. ⟨inria-00074963⟩
35 Consultations
212 Téléchargements

Partager

Gmail Facebook X LinkedIn More