LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System
(2010) IEEE Journal on Selected Areas in Communications — Vol. 28, n° 8, p. 1332-1343 (2010)
Files
2010-jakab-jsac-lisp-tree1.pdf
Open Access - Adobe PDF
- 1.17 MB
Details
- Authors
- 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 measurement-driven simulations of mapping systems' performance, assuming a deployment of LISP in the current Internet.
- Affiliations
Citations
Jakab, L., Cabellos-Aparicio, A., Coras, F., Saucez, D., & Bonaventure, O. (2010). LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System. IEEE Journal on Selected Areas in Communications, 28(8), 1332-1343. https://doi.org/10.1109/JSAC.2010.101011 (Original work published 2010)