Abstract: Routing algorithms such as Distance Vector and Link States have the routing table size as Omega (n), where n is the number of destination identifiers, thus providing only limited scalability ...