search query: @keyword scalability / total: 30
reference: 6 / 30
« previous | next »
Author:Huq, A. M. Anisul
Title:Experimental implementation of a compact routing based mapping system for the locator/ID separation protocol (LISP)
Publication type:Master's thesis
Publication year:2012
Pages:[11] + 103 s. + liitt. 22      Language:   eng
Department/School:Tietotekniikan laitos
Main subject:Tietokoneverkot   (T-110)
Supervisor:Ylä-Jääski, Antti
Instructor:Flinck, Hannu
Electronic version URL: http://urn.fi/URN:NBN:fi:aalto-201210043219
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto     | Archive
Keywords:LISP-ALT
compact routing
BGP
scalability
aggregation
Abstract (eng): It is by now something of a cliché to talk about the "explosive" or "exponential" growth of the Internet.
However, the fact remains; the number of participant networks in the Internet has grown phenomenally, far beyond what the initial designers had in mind.
This unprecedented growth has caused the existing Internet routing architecture to face serious scalability issues.
Single numbering space, multi-homing, and traffic engineering, are making routing tables (RTs) of the default free zone (DFZ) to grow very rapidly.
In order to solve this issue, it had been proposed to review the Internet addressing architecture by separating the end-systems identifiers' space and the routing locators' space.

Several such proposals exist, among which Locator/Identifier Separation Protocol (LISP) is the only one already being shipped in production routers.
As LISP considers two different address spaces, a mapping system is required to provide bindings between the two.
Out of several proposed mapping systems, LISP-ALT has emerged as the de-facto one, as it has a complete implementation for the Cisco NX-OS and IOS platforms.
LISP-ALT's downsides being, it's wide. reuse of BGP and assuming a "highly aggregatable" or administratively pre-allocated IP address space; making it unsuitable for solving the routing scalability problem.

The concept of Compact Routing on the other hand, guarantees that the size of the RT will grow sub-linearly, which goes a long way in solving the scalability problem of DFZ RTs.
It also puts an upper bound to the latency experienced by a datagram packet.
The major drawback here is that, the "label"/address in Compact Routing comprises of three parts which cannot be implemented by any existing addressing scheme.
Furthermore, it assumes a static network topology, which is absurd in the current Internet infrastructure.

Therefore this thesis presents the implementation of an experimental mapping system called CRM that combines the perceived benefits of both Compact Routing and LISP.
In this mapping system, the critical functions that affect the scalability of the routing system are grounded to the theory of Compact Routing; so that we might overcome the shortcomings of LISP-ALT.
We mitigated Compact Routing's presumption of a static network by reusing LISP's registration messages and choosing landmarks dynamically based on their capability to aggregate.
The key objective of this thesis work is to provide proof of concept, to give us first-hand experience regarding the complicacies that arise with the actual development of such a mapping system.
Our work also includes a comprehensive comparison between CRM and LISP-ALT.
The results suggest that, CRM would be feasible in the current Internet if deployed and it would be far less expensive than LISP-ALT.
ED:2012-08-22
INSSI record number: 45083
+ add basket
« previous | next »
INSSI