Computational performance bounds for Markov chains with applications

For Markov chains exhibiting translation invariance of their transition probabilities on polyhedra covering the state space, we develop computational performance bounds for key measures of system performance. Duality allows us to obtain linear programming performance bounds. The Markov chains considered can be used to model multiclass queueing networks operating under affine index policies, a class of policies which subsume many that have been proposed.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2008-06
Language
ENG
Keywords

QUEUING-NETWORKS; SCHEDULING POLICIES

Citation

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, v.53, pp.1306 - 1311

ISSN
0018-9286
DOI
10.1109/TAC.2008.921013
URI
http://hdl.handle.net/10203/9159
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
000258868400022.pdf(263.04 kB)Download
  • Hit : 375
  • Download : 235
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 5 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0