摘要
互联网面临的主要挑战之一就是路由系统的可扩展性。针对如何减少核心路由表规模,如何减小路径查询长度,如何避免IP语义过载等是亟待解决的问题。基于位置与身份标识分离(locator/ID separation protocol,LISP)协议和Chord算法提出了一种新的映射方法 LISP-Chord。LISP-Chord映射查询机制采用Chord算法,将端标识—路由位置(endpoint identifiers-to-routing locators,EID-to-RLOC)映射关系分布式的存储在映射服务器(MapServ-er)上进行资源查询。仿真结果表明,相比LISP-MAP,LISP-Chord协议具有更低的路由表复杂度,更低的节点加入退出开销以及更低的查询跳数。
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.
出处
《重庆邮电大学学报（自然科学版）》
CSCD
北大核心
2013年第1期39-43,共5页
Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金
国家重点基础研究发展计划("973"计划)(2012CB315803)~~
