LISP-DHT: Towards a DHT to map identifiers onto locators

Sat, 11/29/2008 - 00:03 by Damien Saucez • Categories:

Abstract

Recent activities in the IRTF (Internet Research Task Force),
and in particular in the Routing Research Group (RRG), fo-
cus on defining a new Internet architecture, in order to solve
scalability issues related to interdomain routing. The re-
search community has agreed that the separation of the end-
systems' addressing space (the identifiers) and the routing
locators' space will alleviate the routing burden of the De-
fault Free Zone. Nevertheless, such approach, adding a new
level of indirection, implies the need of storing and distribut-
ing mappings between identifiers and routing locators. In
this paper we present LISP-DHT, a mapping distribution sys-
tem based on Distributed Hash Tables (DHTs). LISP-DHT
is designed to take full advantage of the DHT architecture in
order to build an efficient and secured mapping lookup sys-
tem while preserving the locality of the mapping. The paper
describes the overall architecture of LISP-DHT, explaining
its main points and how it works.

Authors
Laurent Mathy and Luigi Iannone
Source
ReArch'08, 12 2008.
Full text
pdf    (175.3 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.