Towards a Compact Routed Internet.

The BGP routing table continues to grow. Reducing the table size means that memory can be made available for other in-router processing. Compact routing provides a method for reducing table size whilst sacrificing the shortest path property. We propose a deployable compact routing scheme and consider the challenges of such an implementation. We evaluate using large-scale emulations and compare against current routing protocols.