首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种基于位置与身份标识分离协议的映射查询方法
引用本文:陈前斌,王磊,唐伦.一种基于位置与身份标识分离协议的映射查询方法[J].重庆邮电大学学报(自然科学版),2013,25(1):39-43.
作者姓名:陈前斌  王磊  唐伦
作者单位:重庆邮电大学移动通信技术重庆市市级重点实验室,重庆,400065
基金项目:国家重点基础研究发展计划(“973”计划)(2012CB315803)
摘    要:互联网面临的主要挑战之一就是路由系统的可扩展性.针对如何减少核心路由表规模,如何减小路径查询长度,如何避免IP语义过载等是亟待解决的问题.基于位置与身份标识分离(locator/ID separation protocol,LISP)协议和Chord算法提出了一种新的映射方法LISP-Chord.LISP-Chord映射查询机制采用Chord算法,将端标识—路由位置(endpoint identifiers-to-routing locators,EID-to-RLOC)映射关系分布式的存储在映射服务器(MapServer)上进行资源查询.仿真结果表明,相比LISP-MAP,LISP-Chord协议具有更低的路由表复杂度,更低的节点加入退出开销以及更低的查询跳数.

关 键 词:位置与标识分离  Chord算法  可扩展性  映射关系
收稿时间:2012/12/11 0:00:00

Method of mapping lookup based on locator/identifier separation protocol
CHEN Qianbin,WANG Lei,TANG Lun.Method of mapping lookup based on locator/identifier separation protocol[J].Journal of Chongqing University of Posts and Telecommunications,2013,25(1):39-43.
Authors:CHEN Qianbin  WANG Lei  TANG Lun
Institution:(Chongqing Key Lab of Mobile Communications Technology,Chongqing University of Posts and Communications, Chongqing 400065,P.R.China)
Abstract: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.
Keywords:locator/ID separation  chord algorithm  scalability  mapping relation
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆邮电大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号