LISP-TREE: a DNS hierarchy to support the lisp mapping system

  • Authors:
  • Loránd Jakab;Albert Cabellos-Aparicio;Florin Coras;Damien Saucez;Olivier Bonaventure

  • Affiliations:
  • Department of Computer Architecture, Universitat Politècnica de Catalunya, Barcelona, Spain;Department of Computer Architecture, Universitat Politècnica de Catalunya, Barcelona, Spain;Department of Computer Architecture, Universitat Politècnica de Catalunya, Barcelona, Spain;Department of Computer Science and Engineering, Université Catholique de Louvain, Louvainla-Neuve, Belgium;Department of Computer Science and Engineering, Université Catholique de Louvain, Louvainla-Neuve, Belgium

  • Venue:
  • IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

During the last years, some operators have expressed concerns about the continued growth of the BGP routing tables in the default-free zone. Several proposed solutions for this issue are centered around the idea of separating the network node's identifier from its topological location. Among the existing proposals, the Locator/ID Separation Protocol (LISP) has seen important development and implementation effort. LISP relies on a mapping system to provide bindings between locators and identifiers. The mapping system is a critical protocol component, and its design is still an open issue. In this paper we present a new mapping system: LISP-TREE. It is based on DNS and has a similar hierarchical topology: blocks of identifiers are assigned to the levels of the hierarchy by following the current IP address allocation policies. We also present measurementdriven simulations of mapping systems' performance, assuming a deployment of LISP in the current Internet.