A semidefinite optimization approach to the steady-state analysis of queueing systems

DOI10.1007/s11134-007-9028-7zbMath1165.90387OpenAlexW2155507183MaRDI QIDQ2641954

Karthik Natarajan, Dimitris J. Bertsimas

Publication date: 17 August 2007

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-007-9028-7

zbMATH Keywords

waiting timesemidefinite optimizationsteady-state distribution

Mathematics Subject Classification ID

Semidefinite programming (90C22) Queues and service in operations research (90B22)

Related Items (9)

Process Flexibility: A Distribution-Free Bound on the Performance of k-Chain ⋮ An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems ⋮ Distributionally robust views on extremal queues ⋮ On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough ⋮ On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems ⋮ Analysis of transient queues with semidefinite optimization ⋮ Optimization-Based Calibration of Simulation Input Models ⋮ Robust transient analysis of multi-server queueing systems and feed-forward networks ⋮ Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and invariant probabilities
• Bounds on measures satisfying moment conditions.
• Stochastically recursive sequences and their generalizations
• Persistence in discrete optimization under data uncertainty
• On the Relation Between Option and Stock Prices: A Convex Optimization Approach
• Inequalities for moments of tails of random variables, with a queueing application
• Idle period approximations and bounds for the GI/G/1 queue
• Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
• Applied Probability and Queues
• Optimal Inequalities in Probability Theory: A Convex Optimization Approach
• A Conic Programming Approach to Generalized Tchebycheff Inequalities
• Some inequalities for the queue GI/G/1
• On the Theory of Queues With Many Servers

This page was built for publication: A semidefinite optimization approach to the steady-state analysis of queueing systems