A protocol scheme for a class of minimum delay routing algorithms
P.J.M. van Haaften · 1991
In this report protocols and proofs of correctness are given for a class of minimum delay routing algorithms. The class of routing algorithms is described by the iteration b + = b + Ab, i = 1, ..., N - 1 where for each i bi is the routing vector at node i and the vector Ab is a solution to the following problem: miniraise rAbi + ,AbiTMiAbi subject to b + Abi >_ 0, y! Abi! = 0, Abi,(t) = 0 for 1 E B(t).