Linear programming relaxations and marginal productivity index policies for the buffer sharing problem

DOI10.1007/S11134-008-9096-3MaRDI QIDQ1007148zbMATH OpenOpenAlexFDO

Authors Jianhua Cao, Christian Nyberg

Publication date 27 March 2009

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-008-9096-3

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
• A new LP formulation of the admission control problem modelled as an MDP under average reward criterion
• Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
• A linear programming approach to stability, optimisation and performance analysis for Markovian multiclass queueing networks
• The archievable region method in the optimal control of queueing systems; formulations, bounds and policies

Cites work

• A \((2/3)n^{3}\) fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain
• A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Dynamic priority allocation via restless bandit marginal productivity indices
• Dynamic programming and optimal control. Vol. 1.
• scientific article; zbMATH DE number 4087408 (Why is no real title available?)
• Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
• Multiservice loss models for broadband telecommunication networks
• Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues
• Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
• Restless bandits, partial conservation laws and indexability
• Sharing Memory Optimally
• Using TCP rate control for queue input-output rate matching

This page was built for publication: Linear programming relaxations and marginal productivity index policies for the buffer sharing problem

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