Sequential IP address lookup in the routing table of routers has complexity O(n). This lookup can be reduced to O(1) time complexity, trading of with the space complexity which can be exponential in the worst case i.e. exp(2,33) - 1 on implementing tries.
