On the tradeoff of average delay, average service cost, and average utility for single server queues with monotone policies

TL;DR

This paper analyzes the fundamental tradeoffs between delay, service cost, and utility in single server queueing systems with monotone policies, providing asymptotic characterizations of optimal performance.

Contribution

It introduces a framework for understanding the tradeoff among delay, cost, and utility in queueing models with monotone policies, including asymptotic analysis.

Findings

Characterizes the minimum average delay as a function of cost and utility constraints.

Provides asymptotic bounds for delay in queueing systems with monotone policies.

Applies to both continuous and discrete time queueing models.

Abstract

In this thesis, we study the optimal tradeoff of average delay, average service cost, and average utility for single server queueing models, with and without admission control. The continuous time and discrete time queueing models that we consider are motivated by cross-layer models for noisy point-to-point links, with random packet arrivals. We study the above tradeoff problem for a class of admissible policies, which are monotone and stationary and obtain an asymptotic characterization of the minimum average delay as a function of the average service cost and average utility constraints.