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.
Chapter PDF
Similar content being viewed by others
References
LISP Testbed, http://www.lisp4.net/
Farinacci, D., Fuller, V., Meyer, D., Lewis, D.: LISP Alternative Topology (LISP+ALT). draft-ietf-lisp-alt-10 (December 2011)(work in progress)
Denning, P.J.: The working set model for program behavior. Commun. ACM 11(5), 323–333 (1968)
Denning, P.J., Schwartz, S.C.: Properties of the working-set model. Commun. ACM 15(3), 191–198 (1972)
Farinacci, D., Fuller, V., Meyer, D., Lewis, D.: Locator/ID Separation Protocol (LISP). draft-ietf-lisp-17 (December 2011) (work in progress)
Feldmeier, D.: Improving gateway performance with a routing-table cache. In: INFOCOM 1988. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, pp. 298–307. IEEE (1988)
Hinden, R.: New Scheme for Internet Routing and Addressing (ENCAPS) for IPNG. RFC 1955 (Informational) (June 1996)
Huston, G.: BGP Report, http://bgp.potaroo.net/
Iannone, L., Bonaventure, O.: On the Cost of Caching Locator/ID Mappings. In: Proceedings of the 3rd International Conference on emerging Networking EXperiments and Technologies (CoNEXT 2007), pp. 1–12. ACM (December 2007)
Jain, R.: Characteristics of destination address locality in computer networks: A comparison of caching schemes. Computer Networks and ISDN Systems 18(4), 243–254 (1990)
Jakab, L., Cabellos-Aparicio, A., Coras, F., Saucez, D., Bonaventure, O.: LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System. IEEE Journal on Selected Areas in Communications 28(8), 1332–1343 (2010)
Kim, C., Caesar, M., Gerber, A., Rexford, J.: Revisiting Route Caching: The World Should Be Flat. In: Moon, S.B., Teixeira, R., Uhlig, S. (eds.) PAM 2009. LNCS, vol. 5448, pp. 3–12. Springer, Heidelberg (2009)
Kim, J., Iannone, L., Feldmann, A.: A Deep Dive into the LISP Cache and What ISPs Should Know about It. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds.) NETWORKING 2011, Part I. LNCS, vol. 6640, pp. 367–378. Springer, Heidelberg (2011)
Li, T.: Recommendation for a Routing Architecture. RFC 6115 (Informational) (February 2011)
Menth, M., Hartmann, M., Hofling, M.: FIRMS: a future Internet mapping system. IEEE Journal on Selected Areas in Communications 28(8), 1326–1331 (2010)
Meyer, D., Zhang, L., Fall, K.: Report from the IAB Workshop on Routing and Addressing. RFC 4984 (Informational) (September 2007)
O’Dell, M.: GSE - An Alternate Addressing Architecture for IPv6. draft-ietf-ipngwg-gseaddr-00.txt (1997)
University of Oregon: RouteViews Project, http://www.routeviews.org
Fuller, V., Farinacci, D., Lewis, D.: LISP Delegated Database Tree (LISP-DDT) draft-ietf-lisp-ddt-00 (November 2011) (work in progress)
WITS: Waikato Internet Traffic Storage, http://www.wand.net.nz/wits/catalogue.php
Zhang, H., Chen, M., Zhu, Y.: Evaluating the performance on ID/Loc mapping. In: Global Telecommunications Conference (GLOBECOM 2008), pp. 1–5 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Coras, F., Cabellos-Aparicio, A., Domingo-Pascual, J. (2012). An Analytical Model for the LISP Cache Size. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30045-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-30045-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30044-8
Online ISBN: 978-3-642-30045-5
eBook Packages: Computer ScienceComputer Science (R0)