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 server’s schedule. Another is to maximize a utility function of the departure rates of the customer classes. Real-time flows have a delay bound for each of their packets. It is particularly challenging to provide delay guarantees for real-time flows in wireless networks since wireless transmissions are unreliable. We propose a model that jointly considers the delay bounds of packets, the unreliable wireless channels, and the throughput requirements of clients. We then determine the necessary and sufficient condition for feasibility of the client requirements. The analysis and condition are interesting since this problem gives rise to some new features concerning unavoidable idle times in a system. We further derive an efficient, nearly linear time algorithm for admission control, which precisely determines whether it is feasible to fulfill the requirements of all clients in the system. We also propose two on-line scheduling policies and prove that they can fulfill the requirements of all clients whenever that is feasible. We next turn to the scenario where the throughput requirements of clients are elastic, but with hard delay bounds. We formulate this as a utility maximization problem, where client utilities are based on their throughputs. We decompose this problem into two subproblems, and show that this decomposition can be naturally implemented as a bidding game among all clients and the access point, which plays the role of a centralized scheduler. In the bidding game, the strategy of each client is to carry out a simple selfish optimization. We show that the strategy of the access point can be implemented by a simple on-line scheduling policy. A surprising result is that the channel reliabilities need not be known a priori.