Hierarchical max-flow routing
Chansook Lim, Stephan K. Bohacek, João P. Hespanha, Katia Obraczka · GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
This paper describes a technique to reduce the computational complexity of max-flow routing, based on a hierarchical decomposition of the network. The computational complexity of this hierarchical max-flow routing is comparable to that of Dijkstra's and Bellman-Ford's algorithms. It is shown that in many of today's networks, this hierarchical approach provides nearly the same performance as flat (i.e., non-hierarchical) routing, with significantly less computation.