基于Grover搜索的多约束路由算法  

A Multi-Constrained Routing Algorithm based on Grover Search

作　　者：刘永广[1,2] 

机构地区：[1]广东轻工职业技术学院,广东广州510300 [2]中国电子科技集团第七研究所,广东广州510310

出　　处：《通信技术》2015年第5期594-597,共4页Communications Technology

摘　　要：寻找满足多约束条件的Qo S路由是网络业务能否顺利实施的关键,在研究和分析了当前多种典型相关算法的基础上,提出了一种基于Grover量子搜索思想的多约束路由算法。算法对路径采用了非线性路径长度的度量方法,分析了Grover搜索的特点和优势,根据Grover迭代的实现过程构建了操作矩阵和概率扩散矩阵,通过选择高概率的节点进行数据转发。仿真表明,该算法在最短路径获取和路由发现成功率方面都有高效的表现。To find a Qo S route satisfying multi-constrained conditions is the key to realizing network business smoothly. Based on research and analysis of several classic algorithms,a multi-constrained routing algorithm based on Grover quantum search is proposed. This algorithm,with a measure of nonlinear path length,analyzes the features and advantages of Grover search,constructs operation matrix and probability diffusion matrix according to the implementaion process of Grover iteration,and transmits data by selecting the nodes with high probability. Simulations indicate that the proposed algorithm enjoys high-efficiency in terms of the shortest path acquisition and success ratio of route discovery.

关 键 词：Grover搜索 多约束 路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]