A State-Dependent Polling Model with Markovian Routing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 1995

A State-Dependent Polling Model with Markovian Routing

Abstract

A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state of the last visited queue. The stationary distribution of the position of the server is given. Ergodicity conditions are obtained by means of an associated dynamical system. Under rotational symmetry assumptions, average queue length and mean waiting times are computed.
Fichier principal
Vignette du fichier
taxicab.pdf (235.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00717705 , version 1 (13-07-2012)

Identifiers

Cite

Guy Fayolle, Jean-Marc Lasgouttes. A State-Dependent Polling Model with Markovian Routing. Frank P. Kelly and Ruth R. Williams. Stochastic networks, 71, Springer-Verlag, pp.283-312, 1995, The IMA Volumes in Mathematics and its Applications, 0-387-94531-8. ⟨hal-00717705⟩

Collections

INRIA INSMI INRIA2
93 View
141 Download

Altmetric

Share

Gmail Facebook X LinkedIn More