4 problems

Let $M$ and $N$ be the numbers of file parts and peers in the dissemination problem, respectively, and let $n$ and $x$ be the parameters defined by the preceding schedule construct…

Recurrence-threshold conjecture. For some $a_K>0$, the process is positive recurrent if $0<\mu/\lambda<a_K$ and null recurrent if $\mu/\lambda>a_K$.

Recurrence threshold conjecture. If $\lambda=U_s$, the process is positive recurrent if $0 < \mu < \mu_o$ and is null recurrent if $\mu > \mu_o$.

In the one-to-many file-transfer problem, let the dynamic piecewise-static solution choose an ordering of peers and allocate transmission rates across epochs, with finite downlink…