Method of mapping lookup based on locator/identifier separation protocol
一种基于位置与身份标识分离协议的映射查询方法

One of the most challenges the current Internet faces is the scalability of routing system.How to reduce the size of the core routing table, how to reduce path query length, how to avoid IP semantic overload are unresolved problems. In this paper we present a new mapping method called LISP-Chord which is based on the LISP protocol and Chord algorithm, the mapping relation EID-to-RLOC distributed and stored in the database for resource lookup. The simulation results show that LISP-Chord, compared with LISP-MAP, has the low routing table complexity, the low cost of node joining and quiting, and the low number of lookup hops.