SPSA: shortest path selection algorithm to solve the unnecessary hop problem in LISP-DHT
SPSA: shortest path selection algorithm to solve the unnecessary hop problem in LISP-DHT
- Author(s): Tai Zhang and Sheng Wang
- DOI: 10.1049/cp.2011.1472
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
2011 International Conference on Advanced Intelligence and Awareness Internet (AIAI 2011) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): Tai Zhang and Sheng Wang Source: 2011 International Conference on Advanced Intelligence and Awareness Internet (AIAI 2011), 2011 p. 275 – 278
- Conference: 2011 International Conference on Advanced Intelligence and Awareness Internet (AIAI 2011)
- DOI: 10.1049/cp.2011.1472
- ISBN: 978-1-84919-471-6
- Location: Shenzhen, China
- Conference date: 28-30 Oct. 2011
- Format: PDF
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.
Inspec keywords: telecommunication network routing; protocols; computer network security; IP networks; Internet
Subjects: Other computer networks; Protocols; Computer communications; Data security; Communication network design, planning and routing; Protocols
Related content
content/conferences/10.1049/cp.2011.1472
pub_keyword,iet_inspecKeyword,pub_concept
6
6