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, Lubomir T. Chitkushev, Louis Pouzin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2011 International Conference on the Network of the Future, NOF 2011 - Proceedings
Pages57-61
Number of pages5
DOIs
Publication statusPublished - 2011
Event2011 2nd International Conference on the Network of the Future, NOF 2011 - Paris, France
Duration: 28 Nov 201130 Nov 2011

Publication series

Name2011 International Conference on the Network of the Future, NOF 2011 - Proceedings

Conference

Conference2011 2nd International Conference on the Network of the Future, NOF 2011
Country/TerritoryFrance
CityParis
Period28/11/201130/11/2011

Fingerprint

Dive into the research topics of 'Bounding the router table size in an ISP network using RINA'. Together they form a unique fingerprint.

Cite this