Implementing the Locator/ID Separation Protocol: Design and Experience
Sun, 11/14/2010 - 01:13 by Olivier Bonaventure
Abstract
During last years, the network research community and the industry have been working on the design of an alternate Internet Routing Architecture aiming at solving the issues arising in the current architecture. It is widely accepted that applying Locator/ID separation paradigm would result into a more scalable and flexible architecture. As the name suggests, in Locator/ID separation the identification (ID) and the localization (locator) of end-points is separated, while the link between the ID and the Locator(s) is ensured by what is called the mapping system.
In this paper we present OpenLISP, an open source implementation of LISP (Locator/ID Separation Protocol). LISP is a Locator/Identifier sepa- ration solution based on the map-and-encap approach, which has the merit of being incrementally deployable, hence, falling in the category of dirty-slate approaches. OpenLISP is not only the implementation of the LISP specifica- tions, it also defines the mapping sockets, a socket-based abstraction making the data plane and the control plane implementations independent. The evaluation provided in this paper show the limited impact on the protocol stack performances compared to traditional non-encapsulated traffic.
- Authors
- Luigi Iannone, Damien Saucez and Olivier Bonaventure
- Source
Computer Networks , 55(4):948-958, March 2011.- Notes
- See http://dx.doi.org/10.1016/j.comnet.2010.12.017 and http://www.openlisp.org/
- Full text
-
(660.27 KB) - Cite it
- BibTex
- Copyright
- 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.