= Solution
Take $0<x\leq B$ and a finite-cost burst rate $v>C$. For the <constant-rate burst path> just constructed, let $t_0=x/(v-C)$. On $0\leq s\leq t_0$ its net input is $z(s)=(v-C)s$, so the <supremum> is x and the <infimum> is zero. The finite-buffer formula evaluated at $t=t_0$ is therefore $\min(x,B)=x$. Since $\bar q\leq q=x$, we conclude $\bar q=x$ exactly: the burst never needs more space than the permitted capacity.
That path's action bounds the contracted finite-buffer rate, and optimizing gives
$$
\bar J(x)\leq\inf_{v>C}\frac{xg(v)}{v-C}=J(x),\qquad0<x\leq B.
$$
At zero use the typical-rate path to obtain $\bar J(0)=J(0)=0$. If the positive infinite-buffer rate is infinite, the asserted upper inequality is automatic. Approximating burst rates suffice, so the argument does not rely on an unproved existence of an optimal duration. Consequently $\boxed{\bar J(x)\leq J(x)\text{ for }0\leq x\leq B}$.
\Image[/past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2004/iii/paper-31-burst-path.png]
{title=A constant-rate burst attaining x within buffer capacity B}
Back to article page