3 problems

Optimal constant-queue routing conjecture. The 3D Layer Code can be generalized using an optimal routing algorithm with $O(1)$ queue: all $X$ checks can be routed in parallel in on…

Let $U_{\textrm{rout}}(t)$ denote the routing-app control influencing the influx of cars on a highway segment. The road is described by the transformed variables $w$ and $v$, with…

Consider a multihop wireless network in which complete route selection chooses all relays jointly. Hop-by-hop routing conjecture. Hop-by-hop route selection, which is more realisti…