Dynamic Optimization with Applications to Dynamic Rate Queues

Abstract

Keywords This tutorial presents recent developments in the management of communications services and applies broadly to services involving the leasing of shared resources. These problems are more realistically modeled by queues with time-varying rates or more simply, dynamic rate queues. We first provide a review and summary of relevant results for various fundamental dynamic rate queues. The focus here is on approximations of these queueing models by low-dimensional dynamical systems. The dynamic optimization of constrained dynamical systems is based on the calculus of variations and its various incarnations over the past three centuries. We discuss these methods in the context of Lagrangians, Hamiltonians, and Bellman value functions. Finally, we provide examples where we apply these optimization techniques to dynamic rate queues motivated by communications decision problems. Bellman value function; calculus of variations; conservation principles; differential

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 17 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.