2010
DOI: 10.1109/jsac.2010.101011
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
35
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
4
3
2

Relationship

6
3

Authors

Journals

citations
Cited by 55 publications
(45 citation statements)
references
References 21 publications
1
35
0
Order By: Relevance
“…LISP is a pull-based architecture that stores the state in the Mapping System, network entities (e.g, LISP Tunnel Routers) retrieve and cache only locally relevant state on demand. Furthermore, the literature shows that the Mapping System internals can be designed to be scalable [9].…”
Section: Lisp: An Sdn Architecture?mentioning
confidence: 99%
See 1 more Smart Citation
“…LISP is a pull-based architecture that stores the state in the Mapping System, network entities (e.g, LISP Tunnel Routers) retrieve and cache only locally relevant state on demand. Furthermore, the literature shows that the Mapping System internals can be designed to be scalable [9].…”
Section: Lisp: An Sdn Architecture?mentioning
confidence: 99%
“…This is the approach followed by the Delegated Database Tree (DDT) based on [9], the Mapping System design used on the current LISP Internet deployment (lisp4.net). On the other hand, some deployments could require a flat name space, this is the case of non-aggregatable data such as character strings.…”
Section: B Distributed Mapping Databasementioning
confidence: 99%
“…For any domain, the PoP with the largest degree was elected as the representant. In about 30% of the cases, when iPlane failed to provide an answer, we used a latency estimator based on geographical distance described in [51].…”
Section: Internet Inter-domain Topologymentioning
confidence: 99%
“…Where IP clients use the address retrieved by DNS to base their networking connections on, we propose a slightly different solution based on LISP-TREE [21] and its equivalent LISP-DDT [22]. Applications base their communication on the context-related names, while networking instances on either the hosts or gateways near them translate the Interests to their location-aggregated names 7 .…”
Section: Local Area Networkmentioning
confidence: 99%