Routing Hierarchy

• Routing overhead scales with the number of nodes

  • for N nodes
    • shortest path is about O(N log N) algorithm
    • routing table size is O(N)

• So to scale, routing is built into a hierarchy [general principal]

Previous slide

Next slide

Back to first slide

View graphic version