基于蚁群算法的可信网络路由  

Trusted routing of network based on ant algorithm

作　　者：马军煜[1] 成旭华[1] 叶学义[1] 

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

出　　处：《电子技术应用》2010年第1期91-94,共4页Application of Electronic Technique

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

摘　　要：针对不同的网络实际条件,提出一种基于蚁群算法的可信网络路由算法,以寻找网络中任意2个节点间的最优路由。在将链路带宽使用情况作为影响路由重组结果可信度的因素时,同时考虑了路由中节点间链路上的耗费和延时这两个因素,实现了可信的网络路由重组。仿真结果显示,该方法在较快地找到较低耗费和延时路由的同时,能够有效地提高路由重组结果的可信度。A new trusted routing approach based on ant algorithm is briefly discussed in this paper to obtain the optimum path between two nodes in the network. The capacity limitation of the links in the network can be seemed as a trusting factor which has influence on the results of routing reconfiguration. Considering the factors of delay and cost, the trusted routing reconfiguration strategy is proposed with the trusting factors. Simulation results show that, having considered two factors of cost and delay, the proposed approach can be used to search the trusted routing efficiently by the available nodes and paths provided with the reconstructed network topology.

关 键 词：路由 重组 蚁群算法 可信计算 

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