Bounding the router table size in an ISP network using RINA
John Day, Eleni Trouva, Eduard Grasa, Patsy Phelan, Miguel Ponce de Leon, Steve Bunch, Ibrahim Matta, Lou T. Chitkushev, Louis Pouzin · 2011
One of the biggest problems of todays Internet is the explosion of the size of the routing tables of Internet core routers, especially due to the growth of multi-homed hosts and networks. This paper explains the benefits that the Recursive InterNetwork Architecture (RINA) brings to network service providers in terms of routing scalability: with an appropriate design the size of the router tables can be bounded. The recursive layer approach, the independence of the address space at each layer in conjunction with the use of hierarchical addressing prove to be effective tools that greatly reduce the storage requirements of routers as well as speed up the calculation of routes, resulting in more efficient and scalable routing.