The Locator ID Separation Protocol (LISP) limits the growth of the Default-Free Zone routing tables by creating a highly aggregatable and quasi-static Internet core. However, LISP pushes the forwarding state to edge routers whose timely operation relies on caching of location to identity bindings. In this paper we develop an analytical model to study the asymptotic scalability of the LISP cache. Under the assumptions that (i) long-term popularity can be modeled as a constant Generalized Zipf distribution and (ii) temporal locality is predominantly determined by long-term popularity, we find that the scalability of the LISP cache is O(1) with respect to the amount of prefixes (Internet growth) and users (growth of the LISP site). We validate the model and discuss the accuracy of our assumptions using several one-day-long packet traces.
Challenges of routing scalability has attracted many research efforts, represented by the works of splitting identifier and locator semantics of IP addresses. A group of identifier-locator (ID Loc) split approaches is commonly featured with a mapping query service system, independent of the routing infrastructure. This is a significant change of the Internet routing architecture that deserves comprehensive analysis and quantitative evaluations. Focusing on the mostly concerned performance issues, we present a canonical model as the typical case where the mapping query is executed for routers performing the ID Loc mappings, and then evaluate the behaviors of caching, query retrieval and queueing introduced by the query latency. According to the results, a well-defined mapping service is able to handle the traffic volume that a current big provider may experience. Furthermore, we also suggest an end system modification to get better performance in the age of ID Loc having been split. Very recent activities in the IETF and in the Routing Research Group (RRG) of the IRTG focus on defining a new Internet architecture, in order to solve scalability issues related to interdo-main routing. The approach that is being explored is based on the separation of the end-systems' addressing space (the identifiers) and the routing locators' space. This separation is meant to alleviate the routing burden of the Default Free Zone, but it implies the need of distributing and storing mappings between identifiers and locators on caches placed on routers. In this paper we evaluate the cost of maintaining these caches when the distribution mechanism is based on a pull model. Taking as a reference the LISP protocol, we base our evaluation on real Netflow traces collected on the border router of our campus network. We thoroughly analyze the impact of the locator ID separation, and related cost, showing that there is a trade-off between the dynamism of the mapping distribution protocol, the demand in terms of bandwidth, and the size of the caches. Due to scalability issues that the current Internet is facing, the research community has re-discovered the Locator ID Split paradigm. As the name suggests, this paradigm is based on the idea of separating the identity from the location of end-systems, in order to increase the scalability of the Internet architecture. One of the most successful proposals, currently under discussion at the IETF, is LISP (Locator ID Separation Protocol). A critical component of LISP, from a performance and resources consumption perspective, as well as from a security point of view, is the LISP Cache. The LISP Cache is meant to temporarily store mappings, i.e., the bindings between identifiers and locations, in order to provide routers with the knowledge of where to forward packets. This paper presents a thorough analysis of such a component, based on real packet-level traces. Furthermore, the implications of policies to increase the level of security of LISP are also analyzed. Our results prove that even a timeout as short as 60 seconds provides high hit ratio and that the impact of using security policies is small.