Bounding the router table size in an ISP network using RINA

Day, John and Trouva, Eleni and Grasa, Eduard and Phelan, Patsy and De Leon, Miguel Ponce and Bunch, Steve and Matta, Ibrahim and Chitkushev, Lubomir T. and Pouzin, Louis (2011) Bounding the router table size in an ISP network using RINA. In: 2011 International Conference on the Network of the Future, NOF 2011 - Proceedings :. 2011 International Conference on the Network of the Future, NOF 2011 - Proceedings . UNSPECIFIED, FRA, pp. 57-61. ISBN 9781457716072

Full text not available from this repository. (Request a copy)

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.

Item Type:	Book Section
Uncontrolled Keywords:	/dk/atira/pure/subjectarea/asjc/1700/1705
Departments or Groups:
Depositing User:	Admin SSL
Date Deposited:	19 Oct 2022 23:16
Last Modified:	27 Jul 2023 19:15
URI:	http://repository-testing.wit.ie/id/eprint/5036

Actions (login required)

View Item