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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andersson, L.-E., Chang, G., and Elfving, T. 1993. Criteria for copositive matrices and nonnegative Bezier patches. Technical Report LiTH-MAT-R-93-27, Linkoping University and University of Science and Technology, China.
Bertsimas, D., Paschalidis, I. Ch., and Tsitsiklis, J. N. 1994. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Annals of Applied Probability 4: 43–75.
Cottle, R. W., Habetler, G. J., and Lemke, C. E. 1970. On classes of copositive matrices. Linear Algebra and Its Applications 3: 295–310.
Jin, H., Ou, J., and Kumar, P. R. 1997. The throughput of irreducible closed markovian queueing networks: Functional bounds, asymptotic loss, efficiency, and the harrison-wein conjectures. Mathematics of Operations Research 22(4): 886–920.
Kumar, S., and Kumar, P. R. 1994. Performance bounds for queueing networks and scheduling policies. IEEE Transactions on Automatic Control AC-39: 1600–1611.
Lippman, S. 1975. Applying a new device in the optimization of exponential queueing systems. Operations Research 23: 687–710.
Morrison, J. R., and Kumar, P. R. 1996. On the guaranteed throughput and efficiency of closed re-entrant lines. Queueing Systems: Theory and Applications. Vol. 28, pp. 33–54, 1998.
Morrison, J. R., and Kumar, P. R. 1997. New linear program performance bounds for queueing networks. Journal of Optimization Theory and Applications. Vol. 100, No. 3, pp. 575–597, March 1999.
Morrison, J. R., and Kumar, P. R. 1997b. Stability and performance analysis of queueing networks with virtual multiserver stations. Proceedings of the 36th IEEE Conference on Decision and Control. pp. 3538–3543, Dec. 1997. San Diego, CA.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Morrison, J.R., Kumar, P.R. New Linear Program Performance Bounds for Closed Queueing Networks. Discrete Event Dynamic Systems 11, 291–317 (2001). https://doi.org/10.1023/A:1011217024661
Issue Date:
DOI: https://doi.org/10.1023/A:1011217024661