SPSA: Shortest path selection algorithm to solve the unnecessary hop problem in LISP-DHT

Author

Tai Zhang ; Sheng Wang

Author_Institution

Sch. of Commun. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China

fYear

2011

fDate

28-30 Oct. 2011

Firstpage

275

Lastpage

278

Abstract

LISP-DHT is a mapping system to support LISP. It is based on widely used DHT. LISP-DHT takes full advantage of the benefits of DHTs such as robustness, scalability and security etc. However, it achieves poor lookup efficiency due to the "Unnecessary Hop" problem. The unnecessary hop problem leads to a query message may traverse the same physical node multiple times, thus it heavily weakens the throughput and lookup efficiency of the mapping system. In this paper, we identify the issues with LISP-DHT which leads to "UH" problem and poor lookup efficiency. We propose the shortest path selection algorithm to solve the UH problem. The theory analysis and simulation results show that the SPSA can solve the Unnecessary Hop problem so as to improve the lookup efficiency of LISP-DHT.

Keywords

IP networks; Internet; computer network security; protocols; telecommunication network routing; DHT; IP address; Internet; locator-ID separation protocol; lookup efficiency; mapping system; security; shortest path selection algorithm; throughput efficiency; unnecessary hop problem; DHT; LISP; LISP-DHT; unnecessary hop;

fLanguage

English

Publisher

iet

Conference_Titel

Advanced Intelligence and Awareness Internet (AIAI 2011), 2011 International Conference on

Conference_Location

Shenzhen

Electronic_ISBN

978-1-84919-471-6

Type

conf

DOI

10.1049/cp.2011.1472

Filename

6233268