pith. sign in

arxiv: 1708.08178 · v2 · pith:6D6NJ4Q7new · submitted 2017-08-28 · 💻 cs.SY · cs.NI· math.PR

Risk-Sensitive Optimal Control of Queues

classification 💻 cs.SY cs.NImath.PR
keywords packetoptimalthresholdcontrolcostrisk-sensitivebufferclient
0
0 comments X p. Extension
pith:6D6NJ4Q7 Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{6D6NJ4Q7}

Prints a linked pith:6D6NJ4Q7 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

We consider the problem of designing risk-sensitive optimal control policies for scheduling packet transmissions in a stochastic wireless network. A single client is connected to an access point (AP) through a wireless channel. Packet transmission incurs a cost $C$, while packet delivery yields a reward of $R$ units. The client maintains a finite buffer of size $B$, and a penalty of $L$ units is imposed upon packet loss which occurs due to finite queueing buffer. We show that the risk-sensitive optimal control policy for such a simple set-up is of threshold type, i.e., it is optimal to carry out packet transmissions only when $Q(t)$, i.e., the queue length at time $t$ exceeds a certain threshold $\tau$. It is also shown that the value of threshold $\tau$ increases upon increasing the cost per unit packet transmission $C$. Furthermore, it is also shown that a threshold policy with threshold equal to $\tau$ is optimal for a set of problems in which cost $C$ lies within an interval $[C_l,C_u]$. Equations that need to be solved in order to obtain $C_l,C_u$ are also provided.

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.