In Search of Sensitivity in Network Optimization (2002)
Cached
Download Links
- [www.nd.edu]
- [black.csl.uiuc.edu]
- [black.csl.uiuc.edu]
- [black.csl.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Queueing Syst |
| Citations: | 2 - 1 self |
BibTeX
@ARTICLE{Chen02insearch,
author = {Mike Chen and Charuhas Pandit and Sean Meyn},
title = {In Search of Sensitivity in Network Optimization},
journal = {Queueing Syst},
year = {2002},
volume = {44},
pages = {313--363}
}
OpenURL
Abstract
This paper concerns policy synthesis in large queuing networks. The results provide answers to the following questions: (i) It is well-known that an understanding of variability is important in the determination of safety stocks to prevent unwanted idleness. Is this the only use of high-order statistical information in policy synthesis? (ii) Will a translation of an optimal policy for the deterministic fluid model (in which there is no variability) lead to an allocation which is approximately optimal for the stochastic network? If so, what is the `regret'? (iii) Where are the highest sources of sensitivity in network control? A sensitivity analysis of an associated fluid-model optimal control problem provides an exact dichotomy in (ii). If an optimal policy for the fluid model is `maximally non-idling', then variability plays a small role in control design.







