首页 | 官方网站   微博 | 高级检索  
     

基于双层递归神经网络的路由优化算法
引用本文:周井泉,张顺颐.基于双层递归神经网络的路由优化算法[J].电子与信息学报,2005,27(12):1901-1904.
作者姓名:周井泉  张顺颐
作者单位:1. 南京邮电大学电子工程系,南京,210003
2. 南京邮电大学校长办公室,南京,210003
摘    要:研究分组交换网的路由选择及流量分配问题,以网络的平均时延为优化目标函数。为使问题的解能实时、可靠地完成,将一种用于最短路径计算的双层递归神经网络应用于路由选择的流量导数法中。仿真结果表明,该算法在收敛的可靠性和计算的实时性方面有所提高。

关 键 词:神经网络  优化算法  流量导数法  最短路径  独立变量
文章编号:1009-5896(2005)12-1901-04
收稿时间:2004-11-29
修稿时间:2005-05-30

Routing Algorithm Based on Two-layer Recurrent Neural Network
Zhou Jing-quan,Zhang Shun-yi.Routing Algorithm Based on Two-layer Recurrent Neural Network[J].Journal of Electronics & Information Technology,2005,27(12):1901-1904.
Authors:Zhou Jing-quan  Zhang Shun-yi
Affiliation:Department of Electronic Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;Director Office, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
Abstract:This paper is concerned with the optimum routing and flow assignment problem in packet-switch networks. The optimum objective function is the network-wide average time delay. To make the solution be implemented reliably in real time, a neural network for shortest path computation that is a two-layer recurrent structure is applied to flow deviation method. Simulation results show that improvements can be achieved in the reliability of successful convergence and in the decrease of computation time.
Keywords:Neural network (NN)  Optimization algorithm  Flow deviation (FD) method  Shortest path (SP)  Independent variables
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号