New linear program performance bounds for queueing networks

DOI10.1023/A:1022638523391MaRDI QIDQ1289396zbMATH OpenFDO

Authors 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

stabilityperformance evaluationschedulingqueueing networks

Mathematics Subject Classification ID

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

Recommendations

• New linear program performance bounds for closed queueing networks
• scientific article; zbMATH DE number 1060034
• Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies
• A linear programming approach to Markov reward error bounds for queueing networks

Cites work

• scientific article; zbMATH DE number 4160608 (Why is no real title available?)
• scientific article; zbMATH DE number 934468 (Why is no real title available?)
• Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies
• Necessary conditions for global stability of multiclass queueing networks
• On classes of copositive matrices
• Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
• Performance bounds for queueing networks and scheduling policies
• Stability of queueing networks and scheduling policies
• The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability
• The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures

Cited in

(19)

• Approximate linear programming for networks: average cost bounds
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Markovian early arrival discrete time Jackson networks
• Reductions of non-separable approximate linear programs for network revenue management
• Performance bounds for scheduling queueing networks
• A linear programming problem in separable closed queueing networks
• Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks
• On deciding stability of multiclass queueing networks under buffer priority scheduling policies
• Performance analysis of queueing networks via robust optimization
• A linear programming approach to Markov reward error bounds for queueing networks
• A characterisation of (max,+)-linear queueing systems
• Performance bounds for queues via generating functions
• Approximate dynamic programming via iterated Bellman inequalities
• A linear programming approach to stability, optimisation and performance analysis for Markovian multiclass queueing networks
• Uncertain convex programs: randomized solutions and confidence levels
• Comparing LP Bounds for Queueing Networks
• Copositive optimization -- recent developments and applications
• New linear program performance bounds for closed queueing networks
• Efficient generation of performance bounds for a class of traffic scheduling problems

This page was built for publication: New linear program performance bounds for queueing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1289396)