Performance analysis of queueing networks via robust optimization
Performance analysis of queueing networks is one of the most challenging areas of queueing theory. Barring very specialized models such as product-form type queueing networks, there exist very few results that provide provable nonasymptotic upper and lower bounds on key performance measures. In this...
Main Authors: | , , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
INFORMS / Operations Research Society of America,
2011-06-17T15:40:21Z.
|
Subjects: | |
Online Access: | Get fulltext |