Title :
Hierarchical max-flow routing
Author :
Lim, Chansook ; Bohacek, Stephan ; Hespanha, João P. ; Obraczka, Katia
Author_Institution :
Dept. of Comput. Sci., Southern California Univ., Los Angeles, CA
Abstract :
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
Keywords :
computational complexity; telecommunication network routing; computational complexity; hierarchical max-flow routing; Computational complexity; Computer networks; Computer science; Game theory; Internet; Robustness; Routing; Switches; Telecommunication traffic; Throughput;
Conference_Titel :
Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE
Conference_Location :
St. Louis, MO
Print_ISBN :
0-7803-9414-3
DOI :
10.1109/GLOCOM.2005.1577684
