Skip to Main content Skip to Navigation
Book sections

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.
Document type :
Book sections
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00717705
Contributor : Jean-Marc Lasgouttes <>
Submitted on : Friday, July 13, 2012 - 2:21:15 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Sunday, October 14, 2012 - 2:50:43 AM

Files

taxicab.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00717705, version 1
  • ARXIV : 1207.3233

Collections

Citation

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⟩

Share

Metrics

Record views

267

Files downloads

389