基于离散粒子群算法的动态网络路由重组  

Routing reconfiguration of network based on discrete particle swarm opti-mization

作　　者：成旭华[1] 赵知劲[1] 叶学义[1] 

机构地区：[1]杭州电子科技大学通信工程学院,杭州310018

出　　处：《计算机工程与应用》2009年第29期96-98,143,共4页Computer Engineering and Applications

基　　金：浙江省科技计划面上重点项目(No.2008C21092);电科院预研基金项目(No.513060401)

摘　　要：寻找最优路由作为动态网络研究的一个重要方面,对于提高网络资源的利用率及可靠性具有现实的应用价值,但无论在理论上还是实际的网络条件下,最优问题一直都是研究难点。针对不同的网络实际条件,提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。在以寻找最小路由总延时作为目标函数的情况下,仿真结果显示该算法能较准确地在网络拓扑结构变化的情况下较快地寻找到最优路径,且显示出了比蚁群算法更好的收敛性能,获得了较好的寻优结果。In order to utilize network resources with high efficiency and ensure the reliability of the network,the optimum path or routing is always an important part on the research of the dynamic network.But this is a difficult issue no matter whether in theory or in a practical dynamic network.In this paper,a new routing approach based on discrete particle swarm optimization al- gorithm is briefly discussed to obtain the optimum path between two nodes in the network.Simulation results show that,especially having considered the factors of delay,the proposed approach can be used to search the routing efficiently by the available nodes and paths provided by the reconstructed network topology even if the network changes,and can obtain better optimum convergence property and routing result than ant algorithm.

关 键 词：路由 重组 离散粒子群 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]