New linear program performance bounds for queueing networks
From MaRDI portal
Publication:1289396
DOI10.1023/A:1022638523391zbMATH Open0949.90019MaRDI QIDQ1289396FDOQ1289396
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)
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
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15)
Cites Work
- Title not available (Why is that?)
- On classes of copositive matrices
- Stability of queueing networks and scheduling policies
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- Performance bounds for queueing networks and scheduling policies
- The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability
- Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies
- Title not available (Why is that?)
- Necessary conditions for global stability of multiclass queueing networks
- The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
Cited In (19)
- A characterisation of (max,+)-linear queueing systems
- Reductions of non-separable approximate linear programs for network revenue management
- Approximate dynamic programming via iterated Bellman inequalities
- New linear program performance bounds for closed queueing networks
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- Uncertain convex programs: randomized solutions and confidence levels
- Markovian early arrival discrete time Jackson networks
- A linear programming problem in separable closed queueing networks
- Performance analysis of queueing networks via robust optimization
- Comparing LP Bounds for Queueing Networks
- Approximate linear programming for networks: average cost bounds
- Efficient generation of performance bounds for a class of traffic scheduling problems
- 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 bounds for queues via generating functions
- Performance bounds for scheduling queueing networks
- A linear programming approach to stability, optimisation and performance analysis for Markovian multiclass queueing networks
- A linear programming approach to Markov reward error bounds for queueing networks
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)