DMCA
Performance Bounds for Queueing Networks and Scheduling Policies (1994)
| Citations: | 82 - 16 self |
BibTeX
@MISC{Kumar94performancebounds,
author = {Sunil Kumar and P. R. Kumar},
title = {Performance Bounds for Queueing Networks and Scheduling Policies},
year = {1994}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Except for the class of queueing networks and scheduling policies admitting a product form solution for the steady--state distribution, little is known about the performance of such systems. For example, if the priority of a part depends on its class (e.g., the buffer that the part is located in), then there are no existing results on performance, or even stability. However, in most applications such as manufacturing systems, one has to choose a control or scheduling policy, i.e., a priority discipline, that optimizes a performance objective. In this paper we introduce a new technique for obtaining upper and lower bounds on the performance of Markovian queueing networks and scheduling policies. Assuming stability, and examining the consequence of a steady--state for general quadratic forms, we obtain a set of linear equality constraints on the mean values of certain random variables that determine the performance of the system. Further, the conservation of time and material gives an au...
