New Linear Program Performance Bounds for Closed Queueing Networks Academic Article uri icon

abstract

  • We develop new linear program performance bounds for closed reentrantqueueing networks based on an inequality relaxation of the averagecost equation. The approach exploits the fact that the transitionprobabilities under certain policies of closed queueing networksare invariant within certain regions of the state space. Thisinvariance suggests the use of a piecewise quadratic functionas a surrogate for the differential cost function. The linearprogramming throughput bounds obtained are provably tighter thanpreviously known bounds at the cost of increased computationalcomplexity. Functional throughput bounds parameterized by thefixed customer population N are obtained, alongwith a bound on the limiting throughput as N → + ∞.We show that one may obtain reduced complexity bounds while stillretaining superiority.

author list (cited authors)

  • Morrison, J. R., & Kumar, P. R

citation count

  • 11

complete list of authors

  • Morrison, JR||Kumar, PR

publication date

  • October 2001