Approximation of discrete-time polling systems via structured Markov chains.
Paul BeekhuizenJ. A. C. ResingPublished in: VALUETOOLS (2009)
Keyphrases
- markov chain
- polling systems
- steady state
- markov processes
- finite state
- heavy traffic
- state space
- markov process
- transition probabilities
- markov model
- queueing networks
- random walk
- stationary distribution
- stochastic process
- setup times
- transition matrix
- approximation algorithms
- confidence intervals
- higher order
- search algorithm
- single server
- scheduling problem
- probabilistic automata
- hidden markov models