On the Dynamics of Locators in LISP

Fri, 02/17/2012 - 13:56 by Damien Saucez


In the Internet, IP addresses play the dual role of identifying the hosts and
locating them on the topology. This design choice limits the way a network can
control its traffic and causes scalability issues. To overcome this limitation,
the Locator/Identifier Separation Protocol (LISP) has been introduced. In LISP,
the addresses used to identify end hosts (i.e., identifiers) are independent of
the addresses used to locate them (i.e., locators). LISP maps identifiers into
a list of locators and provides a mean to transport the packets with the
appropriate locator. A key feature of this separation is that several locators
can be associated to a given identifier, leading to more control for an
end-site on the path selection to reach a given destination.

In this paper, we show that the choice of the locator can have an impact on the
performance and the reliability of the communication in a LISP environment. To
this aim, we build a mapping between identifiers and locators as if LISP were
deployed today. In addition, we extensively collect delay data between
locators and demonstrate that the locator selection for a given identifier
prefix impacts the performance of the LISP path in 25% of the cases. Finally,
we measure the locators availability over time and demonstrate that it remains
quite stable.

Damien Saucez and Benoit Donnet
IFIP Networking 2012, 2012.
Dataset available at http://inl.info.ucl.ac.be/content/locator-reachability-dataset See also http://orbi.ulg.ac.be/bitstream/2268/112567/1/paper.pdf
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 permissions@acm.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.