Routing reconfiguration of network based on discrete particle swarm opti-mization
Xueyi Ye · Computer Engineering and Applications Journal · 2009
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 conver-gence property and routing result than ant algorithm.