New linear program performance bounds for queueing networks

DOI10.1023/A:1022638523391zbMath0949.90019MaRDI QIDQ1289396

P. R. Kumar, James R. Morrison

Publication date: 28 November 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

stabilityschedulingperformance evaluationqueueing networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Approximate linear programming for networks: average cost bounds ⋮ Reductions of non-separable approximate linear programs for network revenue management ⋮ Copositive optimization -- recent developments and applications ⋮ Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Uncertain convex programs: randomized solutions and confidence levels ⋮ On deciding stability of multiclass queueing networks under buffer priority scheduling policies ⋮ Approximate dynamic programming via iterated Bellman inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
• Necessary conditions for global stability of multiclass queueing networks
• On classes of copositive matrices
• Performance bounds for queueing networks and scheduling policies
• The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
• The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability
• Stability of queueing networks and scheduling policies
• Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies