Bounds and Policies for Dynamic Routing in Loss Networks

DOI10.1287/opre.47.3.379zbMath0979.90012OpenAlexW2105792258MaRDI QIDQ2770114

Thalia Chryssikou, Dimitris J. Bertsimas

Publication date: 7 February 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.47.3.379

zbMATH Keywords

Markov decision processadmission controllinear programming relaxationsPoisson arrivalssteady-statedynamic routingexponentially distributed holding timesmaximizing a weighted sum of expected rewardsmulticlass loss network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

Saturation in a Markovian parking process ⋮ OPTIMAL ADMISSION AND ROUTING WITH CONGESTION-SENSITIVE CUSTOMER CLASSES ⋮ Exponential penalty function control of loss networks ⋮ On the performance evaluation of multi-guarded marked graphs with single-server semantics