Skip to Main content Skip to Navigation
Conference papers

An Analytical Model for the LISP Cache Size

Abstract : Concerns regarding the scalability of the inter-domain routing have encouraged researchers to start elaborating a more robust Internet architecture. While consensus on the exact form of the solution is yet to be found, the need for a semantic decoupling of a node’s location and identity is generally accepted as the only way forward. One of the most successful proposals to follow this guideline is LISP (Loc/ID Separation Protocol). Design wise, its aim is to insulate the Internet’s core routing state from the dynamics of edge networks. However, this requires the introduction of a mapping system, a distributed database, that should provide the binding of the two resulting namespaces. In order to avoid frequent lookups and not to penalize the speed of packet forwarding, map-caches that store temporal bindings are provisioned in routers. In this paper, we rely on the working-set theory to build a model that accurately predicts a map-cache’s performance for traffic with time translation invariance of the working-set size. We validate our model empirically using four different packet traces collected in two different campus networks.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, June 1, 2017 - 11:34:56 AM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Wednesday, September 6, 2017 - 6:25:54 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Florin Coras, Albert Cabellos-Aparicio, Jordi Domingo-Pascual. An Analytical Model for the LISP Cache Size. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.409-420, ⟨10.1007/978-3-642-30045-5_31⟩. ⟨hal-01531121⟩



Record views


Files downloads