SpliTable: Toward Routing Scalability Through Distributed BGP Routing Tables
Akeo Masuda, Cristel Pelsser and Kohei Shiomoto
The Internet has grown extremely fast in the last two decades. The number of routes to be supported by the routers has become very large. Moreover, the number of messages exchanged to distribute the routes has increased even faster. In this paper, we propose SpliTable, a scalable way to support the Internet routes in a Service Provider network. In our proposal, BGP route selection is done by distributed servers on behalf of the routers. They are called route selection servers. The selected routes are then stored in distributed routing tables. Each router maintains only its share of Internet routes, not the routes for each Internet prefix as it is the case today. We adapted the concept of Distributed Hash Tables (DHT) for that purpose.
We show analytically that our proposal is more scalable in the num- ber of routes supported in each router than current iBGP route distribution solutions. Moreover, the number of control messages exchanged with our proposal is bounded contrary to current sparse iBGP route distribution so- lutions which may never converge. We confirm these findings in an evalu- ation of a prototype implementation.
In IEICE TRANSACTIONS on Communications, January 2011.
Back to Cristel Pelsser's