Chapter 1 Introduction

Chapter 1 Introduction

• focus on communication and queueing systems formulated problem: optimize the time averages of certain quantities subject to time average constraints on other quantities.

Example opportunistic scheduling problem

Fig. 1 The 2-user wireless system.

Channel-aware scheduling is called opportunistic scheduling. We assume the network controller can observe $\mathcal{S}(t)$ at the beginning of each slot $t$ before making a transmission decision. Queueing dynamics are given by

Q k ( t + 1 ) = max ⁡ [ Q k ( t ) − b ^ k ( p ( t ) , S ( t ) , 0 ] + a k ( t ) ∀ k ∈ { 1 , 2 , ⋯   } Q_k(t+1)=\max[Q_k(t)-\hat{b}_k(p(t),\mathcal{S}(t),0]+a_k(t)\quad \forall k\in\{1,2,\cdots\} Qk​(t+1)=max[Qk​(t)−b^k​(p(t),S(t),0]+ak​(t)∀k∈{ 1,2,⋯}

EXAMPLE PROBLEM 1: MINIMIZING TIME AVERAGE POWER SUBJECT TO STABILITY

Denote p ˉ k