4 problems

Consider the clan of ancestors associated with a space-time point $(x,0)$ in the one-dimensional loss network, and let $N({\bf A}^{(x,0)})$ be the total number of rectangles in tha…

Let $m(s,t)$ denote the number of calls in progress past point $s\in\mathbb{R}$ at time $t\geq 0$ in a one-dimensional loss network with call-attempt rate $\lambda$, call-length di…

Consider the static-routing optimization problem … where $\widetilde{\boldsymbol{\Pi}}^{\textup{SR}}$ is the class of stationary randomized policies that route every arrival to som…

Conjectured vanishing and ordering. It is conjectured that