Caching Locator/ID mappings: An experimental scalability analysis and its implications

Authors:
Juhoon Kim;Luigi Iannone;Anja Feldmann
Affiliations:
Deutsche Telekom Laboratories, Technische Universität Berlin, Ernst-Reuter-Platz 7, 10587 Berlin, Germany;Telecom ParisTech 23, Avenue d'Italie 75013 Paris, France;Deutsche Telekom Laboratories, Technische Universität Berlin, Ernst-Reuter-Platz 7, 10587 Berlin, Germany
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2013

Citing 6
Cited 0

iPlane: an information plane for distributed services

OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
On the cost of caching locator/ID mappings

CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Evaluating the benefits of the locator/identifier separation

Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
Revisiting Route Caching: The World Should Be Flat

PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
HAIR: hierarchical architecture for internet routing

Proceedings of the 2009 workshop on Re-architecting the internet
LISP-TREE: a DNS hierarchy to support the lisp mapping system

IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report

Quantified Score

Hi-index	0.00

Visualization

Abstract

Victim of its own success, the current Internet is facing scalability issues that lead the research community to explore alternative architectures. In particular, the Locator/ID Split paradigm, based on the idea of separating the identity from the location of end-systems, is gaining momentum and seems to be the most promising candidate for the future Internet architecture. A critical component of any Locator/ID Split approach, from a performance and resources consumption perspective, as well as from a security point of view, is the cache. The 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. Taking as reference protocol LISP (Locator/ID Separation Protocol), the most successful proposal currently under discussion at the IETF, this paper presents a thorough analysis of such a component, including the implications of policies to increase the level of security, based on real packet-level traces. Our results prove that even a timeout as short as 60s provides a high hit ratio and that the impact of using security policies is small. Furthermore, a thorough analysis of the scalability of such a component is provided along with the analysis of which class of applications contributes the major fraction of cache-misses.