An Analytical Model for the LISP Cache Size - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

An Analytical Model for the LISP Cache Size

Résumé

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.
Fichier principal
Vignette du fichier
978-3-642-30045-5_31_Chapter.pdf (780.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01531121 , version 1 (01-06-2017)

Licence

Paternité

Identifiants

Citer

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⟩
149 Consultations
73 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More