Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels
We provide an account of recent work that formulates and addresses problems that arise when employing wireless networks to serve clients that generate real-time flows. From a queueing systems perspective, these problems can be described as single-server problems where there are several customer classes. Customers balk when their delay exceeds a threshold. There are a range of issues that are of interest. One of the first such issues is to determine what throughput rate vectors are feasible, and to determine the servers schedule. Another is to maximize a utility function of the departure rates of the customer classes.
delays wireless networks scheduling real-time networks admission control utility maximization network utility maximization 60k25 90b22