pith. sign in

arxiv: math/0501031 · v1 · submitted 2005-01-03 · 🧮 math.PR

An escape time criterion for queueing networks: Asymptotic risk-sensitive control via differential games

classification 🧮 math.PR
keywords timeescaperisk-sensitivevaluecriterionnetworkbuffercontrol
0
0 comments X
read the original abstract

We consider the problem of risk-sensitive control of a stochastic network. In controlling such a network, an escape time criterion can be useful if one wishes to regulate the occurrence of large buffers and buffer overflow. In this paper a risk-sensitive escape time criterion is formulated, which in comparison to the ordinary escape time criteria penalizes exits which occur on short time intervals more heavily. The properties of the risk-sensitive problem are studied in the large buffer limit, and related to the value of a deterministic differential game with constrained dynamics. We prove that the game has value, and that the value is the (viscosity) solution of a PDE. For a simple network, the value is computed, demonstrating the applicability of the approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.