Home > Research > Publications & Outputs > LISP-DHT: towards a DHT to map identifiers onto...
View graph of relations

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

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Publication date2008
Host publicationCoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference
Place of PublicationNew York, NY, USA
PublisherACM
Pages1-6
Number of pages6
ISBN (print)978-1-60558-210-8
<mark>Original language</mark>English

Abstract

Recent activities in the IRTF (Internet Research Task Force), and in particular in the Routing Research Group (RRG), focus on defining a new Internet architecture, in order to solve scalability issues related to interdomain routing. The research 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 Default Free Zone. Nevertheless, such approach, adding a new level of indirection, implies the need of storing and distributing mappings between identifiers and routing locators. In this paper we present LISP-DHT, a mapping distribution system 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 system while preserving the locality of the mapping. The paper describes the overall architecture of LISP-DHT, explaining its main points and how it works.