检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王新良 黄青改 WANG Xinliang, HUANG Qinggai(School of Physics and Electronic Information Engineering, Henan Polytechnic University, Jiaozuo 454000, Chin)
机构地区:[1]河南理工大学物理与电子信息学院,河南焦作454000
出 处:《量子电子学报》2018年第4期461-469,共9页Chinese Journal of Quantum Electronics
基 金:河南省科技攻关计划,172102210274,河南理工大学矿山信息化重点学科开放实验室开放基金,ky2015-18,河南理工大学博士基金,B2012-073
摘 要:在路由信息协议(RIP)中,RIP报文都以明文的方式进行数据传输,存在被窃听、篡改和伪造的可能.为进一步提高RIP协议路由信息交换的安全性,基于量子通信的基本原理提出了自适应量子RIP算法,实现了自治系统内路由信息的有效、安全、快速更新,并尽可能地降低了纠缠资源的消耗。仿真结果表明:与经典量子RIP算法相比,当每一个路由器直接相连网络的数量较多,或自治系统内路由器规模增大时,提出算法能以较少的纠缠粒子资源消耗有效实现路由器路由表的自动更新.结果表明提出算法能更好地实现RIP路由信息的安全传输。In routing information protocal(RIP) packet, RIP messages are transmitted by the plain-text way,so it is possible to be eavesdropped, tampered and forged. In order to further improve the security of routing information exchange in RIP, an adaptive quantum RIP algorithm is proposed based on the basic principle of quantum communication. It realizes the effective, safe and fast update of the routing information in autonomous system, and reduces the consumption of entanglement resources as much as possible. Simulation results show that compared with the classical quantum RIP algorithm, the proposed algorithm can efficiently realize the routing table automatic update of router with resource consumption of less entanglement particles, when the network number directly connected to router is larger, or the router number in autonomous system is larger.Results show that the proposed algorithm can better achieve the secure transmission of RIP routing information.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3