Hierarchical Proportional Routing

  • Srihari Nelakuditi
  • Zhi-Li Zhang
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 739)


We have shown that proportional routing schemes alleviate congestion in the network by distributing load among multiple “good” paths instead of overloading a single “best” path. However these schemes assume that each router in the network is aware of the topology and the state of the whole network. This is referred to as flat routing and under flat routing, each router participates in link state updates and maintains detailed information about the entire network. This introduces significant burden on every router and as the size of the network grows, the overhead at each router increases tremendously. To provide a scalable solution, hierarchical routing is suggested [43, 4] as an alternative to flat routing. To make the proportional routing schemes scale well to large networks we need to extend them to provide hierarchical routing.


Logical Link Blocking Probability Candidate Path Route Traffic Border Router 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Srihari Nelakuditi
    • 1
  • Zhi-Li Zhang
    • 2
  1. 1.University of South CarolinaUSA
  2. 2.University of MinnesotaUSA

Personalised recommendations