On the Cost of Caching Locator/ID Mappings
Fri, 10/05/2007 - 12:01 by Luigi Iannone
Very recent activities in the IETF and in the Routing Research
Group (RRG) of the IRTG focus on defining a new Internet ar-
chitecture, in order to solve scalability issues related to interdo-
main routing. The approach that is being explored is based on
the separation of the end-systems’ addressing space (the identi-
fiers) and the routing locators’ space. This separation is meant
to alleviate the routing burden of the Default Free Zone, but it
implies the need of distributing and storing mappings between
identifiers and locators on caches placed on routers. In this pa-
per we evaluate the cost of maintaining these caches when the
distribution mechanism is based on a pull model. Taking as a
reference the LISP protocol, we base our evaluation on real Net-
flow traces collected on the border router of our campus network.
We thoroughly analyze the impact of the locator/ID separation,
and related cost, showing that there is a trade-off between the
dynamism of the mapping distribution protocol, the demand in
terms of bandwidth, and the size of the caches.
- Full text
- (494.19 KB)
- Cite it
- See here
IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org.
Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.