Abstract
Perturbation analysis of multiclass queuing networks is considered. It is shown that first-order analysis is needed. Detailed discussions of an example system reveal the main features of multiclass queuing networks. An algorithm based on first-order analysis is proposed. This algorithm yields an asymptotically unbiased estimate of the sensitivity for the example system based on only one sample path. The accuracy of first-order perturbation analysis for general queuing networks is discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 2028-2033 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| DOIs | |
| Publication status | Published - 1985 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'FIRST-ORDER PERTURBATION ANALYSIS OF MULTI-CLASS QUEUEING NETWORKS.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver