A unified approach to linear programming bounds for queueing networks: Systems with polyhedral invariance of transition probabilities

J. R. Morrison; P. R. Kumar

A unified approach to linear programming bounds for queueing networks: Systems with polyhedral invariance of transition probabilities

Engineering & Technology, School Of

Research output: Contribution to journal › Conference article › peer-review

Abstract

We develop a framework for obtaining linear programming performance bounds in queueing networks. The structure allowing for the development of the bounds requires that the underlying Markov chain model possess translational invariance of its transition probabilities on polyhedra. Such a structure is exhibited by many systems of interest. The bounds are then obtained via a performance-to-performance duality.

Original language	English
Pages (from-to)	546-551
Number of pages	6
Journal	Proceedings of the IEEE Conference on Decision and Control
Volume	1
State	Published - 2000
Event	39th IEEE Confernce on Decision and Control - Sydney, NSW, Australia Duration: Dec 12 2000 → Dec 15 2000

Keywords

Performance evaluation
Polyhedral invariance
Queueing networks
Scheduling
Semiconductor manufacturing plants
Wafer fabs

Cite this

@article{deaa9444850946aea58dac8a15205b75,

title = "A unified approach to linear programming bounds for queueing networks: Systems with polyhedral invariance of transition probabilities",

abstract = "We develop a framework for obtaining linear programming performance bounds in queueing networks. The structure allowing for the development of the bounds requires that the underlying Markov chain model possess translational invariance of its transition probabilities on polyhedra. Such a structure is exhibited by many systems of interest. The bounds are then obtained via a performance-to-performance duality.",

keywords = "Performance evaluation, Polyhedral invariance, Queueing networks, Scheduling, Semiconductor manufacturing plants, Wafer fabs",

author = "Morrison, {J. R.} and Kumar, {P. R.}",

year = "2000",

language = "English",

volume = "1",

pages = "546--551",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

note = "39th IEEE Confernce on Decision and Control ; Conference date: 12-12-2000 Through 15-12-2000",

}

TY - JOUR

T1 - A unified approach to linear programming bounds for queueing networks

T2 - 39th IEEE Confernce on Decision and Control

AU - Morrison, J. R.

AU - Kumar, P. R.

PY - 2000

Y1 - 2000

N2 - We develop a framework for obtaining linear programming performance bounds in queueing networks. The structure allowing for the development of the bounds requires that the underlying Markov chain model possess translational invariance of its transition probabilities on polyhedra. Such a structure is exhibited by many systems of interest. The bounds are then obtained via a performance-to-performance duality.

AB - We develop a framework for obtaining linear programming performance bounds in queueing networks. The structure allowing for the development of the bounds requires that the underlying Markov chain model possess translational invariance of its transition probabilities on polyhedra. Such a structure is exhibited by many systems of interest. The bounds are then obtained via a performance-to-performance duality.

KW - Performance evaluation

KW - Polyhedral invariance

KW - Queueing networks

KW - Scheduling

KW - Semiconductor manufacturing plants

KW - Wafer fabs

UR - http://www.scopus.com/inward/record.url?scp=0034439890&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0034439890

SN - 0191-2216

VL - 1

SP - 546

EP - 551

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

Y2 - 12 December 2000 through 15 December 2000

ER -

A unified approach to linear programming bounds for queueing networks: Systems with polyhedral invariance of transition probabilities

Abstract

Keywords

Other files and links

Fingerprint

Cite this