%0 Conference Proceedings
%T An Analytical Model for the LISP Cache Size
%+ Universitat Politècnica de Catalunya =  Université polytechnique de Catalogne  [Barcelona] (UPC)
%A Coras, Florin
%A Cabellos-Aparicio, Albert
%A Domingo-Pascual, Jordi
%Z Part 8: LISP and Multi-domain Routing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7289
%N Part I
%P 409-420
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30045-5_31
%K LISP
%K Internet architecture
%K cache modeling
%K working set
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531121/document
%2 https://inria.hal.science/hal-01531121/file/978-3-642-30045-5_31_Chapter.pdf
%L hal-01531121
%U https://inria.hal.science/hal-01531121
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7289
%~ IFIP-NETWORKING