CAJ | 학술논문

QoS路由问题被证明是一个NP-C问题,而传统的路由算法很难有效地解决NP-C问题.该文提出了一种基于蚁群算法、用于解决带宽和时延约束问题的QoS单播路由算法,利用蚁群算法中蚂蚁通过信息素寻找最优路径的机制,并以网络吞吐量和数据报的平均时延等性能为最优的准则,来定义蚂蚁的转移概率、路由表和信息素更新方式,实现基于蚁群算法的路由选择算法.这种算法具有较强全局最优解搜索能力,较强的灵活性,以及潜在的并行性.
QoS로유문제피증명시일개NP-C문제,이전통적로유산법흔난유효지해결NP-C문제.해문제출료일충기우의군산법、용우해결대관화시연약속문제적QoS단파로유산법,이용의군산법중마의통과신식소심조최우로경적궤제,병이망락탄토량화수거보적평균시연등성능위최우적준칙,래정의마의적전이개솔、로유표화신식소경신방식,실현기우의군산법적로유선택산법.저충산법구유교강전국최우해수색능력,교강적령활성,이급잠재적병행성.
QoS routing problem is proved to be a NP-C problem, it is very difficult to solve the NP-C problem effectively by conventional routing algorithms. This paper puts forward an QoS unicast routing algorithm which is based on the principle of ant colony algorithm and used to solve the problem of bandwidth and delay constrain. The rule of ant colony algorithm that the ants find the shortest path through the laying down of pheromone and the rule with emphasis on the maximal network throughput and the lowest average cell delay are also used to define the transition probability of ants, routing table, and the way pheromone is updated. A detailed routing scheme algorithm based on the ant colony algorithm is implemented. Results prove that the algorithm has strong ability of searching an optimum solution and show its better flexibility and potential parallelism.