• DocumentCode
    2961984
  • Title

    Bounding the router table size in an ISP network using RINA

  • Author

    Day, John ; Trouva, Eleni ; Grasa, Eduard ; Phelan, P. ; de Leon, Miguel Ponce ; Bunch, Steve ; Matta, Ibrahim ; Chitkushev, Lubomir T. ; Pouzin, L.

  • Author_Institution
    Comput. Sci., Boston Univ., Boston, MA, USA
  • fYear
    2011
  • fDate
    28-30 Nov. 2011
  • Firstpage
    57
  • Lastpage
    61
  • 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.
  • Keywords
    Internet; telecommunication network routing; ISP network; Internet core router; RINA; multihomed host; multihomed network; network service provider; recursive internetwork architecture; recursive layer approach; router table size; routing scalability; routing table; storage requirement; Computer architecture; IP networks; Internet; Quality of service; Routing; Routing protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network of the Future (NOF), 2011 International Conference on the
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-4577-1605-8
  • Type

    conf

  • DOI
    10.1109/NOF.2011.6126683
  • Filename
    6126683