Hierarchical Routing
Hierarchical Routing
When the network size grows, the number of routers in the network increases.
Consequently, the size of routing tables increases, as well, and routers can’t handle
network traffic as efficiently. We use hierarchical routing to overcome this problem
In hierarchical routing, the routers are divided into regions. Each router has complete
details about how to route packets to destinations within its own region. But it does not
have any idea about the internal structure of other regions.
In hierarchical routing, routers are classified in groups called regions. Each router has
information about the routers in its own region and it has no information about routers in
other regions. So, routers save one record in their table for every other region.
For huge networks, a two-level hierarchy may be insufficient hence, it may be
necessary to group the regions into clusters, the clusters into zones, the zones into
groups and so on.
Example
Consider an example of two-level hierarchy with five regions as shown in figure −
Let see the full routing table for router 1A which has 17 entries, as shown below
1A - -
1B 1B 1
1C 1C 1
2A 1B 2
2B 1B 3
Dest. Line Hops
2C 1B 3
2D 1B 4
3A 1C 3
3B 1C 2
4A 1C 3
4B 1C 4
4C 1C 4
5A 1C 4
5B 1C 5
5C 1B 5
5D 1C 6
5E 1C 5
When routing is done hierarchically then there will be only 7 entries as shown below −
1A - -
1B 1B 1
1C 1C 1
2 1B 2
3 1C 2
4 1C 3
5 1C 4