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

基于并行BP神经网络的路由查找算法
引用本文:胥小波,郑康锋,李 丹,杨义先,钮心忻.基于并行BP神经网络的路由查找算法[J].通信学报,2012(2):61-68.
作者姓名:胥小波  郑康锋  李 丹  杨义先  钮心忻
作者单位:北京邮电大学信息安全中心;北京邮电大学灾备技术国家工程实验室
基金项目:国家自然科学基金资助项目(61070208);中央高校基本科研业务费专项基金资助项目(BUPT2009RC0218,BUPT2010PTB0502);国家发改委信息安全专项基金资助项目;教育部科学技术研究重点基金资助项目~~
摘    要:结合Bloom-filter算法和并行反向传播神经网络,提出了一种新的基于并行神经网络的路由查找算法(BFBP)。该算法满足路由查找的需求,只需学习路由条目的网络ID,且易于扩展到IPv6地址查询。研究结果表明,相比于己有的神经网络路由查找方法,该算法需要学习的条目数平均减少了520倍,提高了学习效率,为神经网络应用于路由查找创造了有利条件。

关 键 词:神经网络  路由查找  反向传播  Bloom-filter算法

Routing lookup algorithm based on parallel BP neural network
XU Xiao-bo,ZHENG Kang-feng,LI Dan,YANG Yi-xian,NIU Xin-xin.Routing lookup algorithm based on parallel BP neural network[J].Journal on Communications,2012(2):61-68.
Authors:XU Xiao-bo  ZHENG Kang-feng  LI Dan  YANG Yi-xian  NIU Xin-xin
Institution:1,2(1.Information Security Center,Beijing University of Posts and Telecommunications,Beijing 100876,China; 2.National Engineering Laboratory for Disaster Backup and Recovery,Beijing University of Posts and Telecommunications,Beijing 100876,China)
Abstract:A new routing lookup algorithm based on Bloom-filter algorithm and parallel back-propagation neural net-works(BFBP) was proposed.The algorithm could meet the challenges of routing lookup and just had to learn the net-work ID moreover,it was equally attractive for IPv6.The results show that compared to other routing lookup methods based on neural network,BFBP algorithm reduces the average number of items which neural network has to learn by 520 times,improves learning efficiency of neural networks,and creates favorable conditions for the application of neural network in the area of routing lookup.
Keywords:neural network  routing lookup  back-propagation  Bloom-filter algorithm
本文献已被 CNKI 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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