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
LISP-DHT: towards a DHT to map identifiers onto locators
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
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
A local approach to fast failure recovery of LISP ingress tunnel routers
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
An analytical model for the LISP cache size
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
A first measurement look at the deployment and evolution of thelocator/id separation protocol
ACM SIGCOMM Computer Communication Review
Hi-index | 0.00 |
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.