LISP ITR Graceful Restart

Thu, 07/12/2012 - 02:35 by Damien Saucez


The Locator/ID Separation Protocol (LISP) is a map-and-encap
mechanism to enable the communication between hosts identified with
their Endpoint IDentifier (EID) over the Internet where EIDs are not
routable. To do so, packets toward EIDs are encapsulated in packets
with routing locators (RLOCs) to form dynamic tunnels. An Ingress
Tunnel Router (ITR) that encapsulates EID packets determines tunnel
endpoints via mappings that associate EIDs to RLOCs. Before
encapsulating a packet, the ITR queries the mapping system to obtain
the mapping associated to the EID of the packet it must encapsulate.
Such mapping is cached by the ITR in its local EID-to-RLOC cache for
any subsequent encapsulation for the same EID. LISP is scalable
because the EID-to-RLOC cache of an ITR, which is initially empty, is
populated progressively according to the traffic going through the
ITR. However, after an ITR is restarted, e.g., for maintenance
reason, its cache is empty which means that all packets that are re-
routed to the freshly restarted ITR will cause cache misses and a
potentially high loss rate. In this draft, we present mechanisms to
reduce the negative impact on traffic caused by the restart of an ITR
in a LISP network.

Damien Saucez, Oliver Bonaventure, Luigi Iannone and Clarence Filsfils
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

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.