An optimal distributed routing algorithm

A distributed optimal one-level routing algorithm is presented. The algorithm is based on Newton's method. Using the variable reduction method, the Hessian matrix becomes diagonal. An example shows that the algorithm has a much faster convergence rate, more accurate results, and better transient behavior than previous work. The algorithm is shown to be convergent, stable, robust, and loop free.<
>