Tight Polynomial Bounds for Steady-State Performance of Marked Graphs.
Javier CamposGiovanni ChiolaJosé Manuel ColomManuel Silva SuárezPublished in: PNPM (1989)
Keyphrases
- steady state
- lower bound
- upper bound
- markov chain
- worst case
- product form
- operating conditions
- explicit expressions
- arrival rate
- state dependent
- queue length
- queueing networks
- graph mining
- heavy traffic
- service times
- variance estimator
- loss probability
- large deviations
- queueing systems
- queueing model
- asymptotically optimal
- vc dimension