One-dimensional search algorithm |

set $\xi =0$ , and Φ as a sufficiently large integer for $\phi =0$ : 1: Φ do (T,E) = Shortest Path (S //solve the shortest path in terms of delay with a fixed $\xi $ if E ≤ E return T else update the offload rate $\xi $ as $\xi +1/\text{\Phi}$ end find the optimal solution ${\xi}^{*}$ for minimal delay $T({\xi}^{*})$ |