Lancaster EPrints

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

Mathy, Laurent and Iannone, Luigi (2008) LISP-DHT: towards a DHT to map identifiers onto locators. In: CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference. ACM, New York, NY, USA, pp. 1-6. ISBN 978-1-60558-210-8

Full text not available from this repository.

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.

Item Type: Contribution in Book/Report/Proceedings
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 57211
Deposited By: ep_importer_pure
Deposited On: 20 Aug 2012 10:15
Refereed?: No
Published?: Published
Last Modified: 12 Dec 2017 02:29
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/57211

Actions (login required)

View Item