Title :
An optimal distributed routing algorithm
Author :
Wang, Zhonghe ; Browning, Douglas W.
Author_Institution :
Motorola Inc., Boynton Beach, FL, USA
fDate :
9/1/1991 12:00:00 AM
Abstract :
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
Keywords :
convergence of numerical methods; iterative methods; matrix algebra; optimisation; switching theory; Hessian matrix; Newton method; accuracy; convergence rate; one-level routing algorithm; optimal distributed routing algorithm; transient behavior; variable reduction method; Algorithm design and analysis; Centralized control; Computer networks; Convergence; Distributed algorithms; Laboratories; Mathematical model; Robustness; Routing; Societies;
Journal_Title :
Communications, IEEE Transactions on
