• Flows f(k,i),j are all nonnegative and positive flows are not assigned to nonexistent links.
• Packets that have reached the destination are not injected back into the network.
We can show the following lemma.
The following is an informal proof. Recall that any link capacity vector in can be achieved by a stationary randomized schedule that chooses the link ...