LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System

Thu, 03/25/2010 - 19:16 by Damien Saucez


During the last years, several operators have expressed concerns about the continued growth of the BGP routing tables in the default-free zone. 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) is the one with the biggest momentum. In LISP, a mapping system is required to provide bindings between locators and identifiers. In this paper we present a new mapping system: LISP-TREE. It is based on DNS and has a similar hierarchical topology: blocks of EIDs are assigned to the levels of the hierarchy by following the current IP address allocation policy. It can work with the existing DNS implementations, providing the benefit of 20 years of operational experience.In addition, we present measurement-driven simulations of mapping systems' performance, assuming deployment of LISP in the current Internet.

Loránd Jakab, Albert Cabellos-Aparicio, Florin Coras, Damien Saucez and Olivier Bonaventure
IEEE Journal on Selected Areas in Communications, 28(8):1332 - 1343, October 2010.
Full text
pdf   (1.17 MB)
Cite it
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.