The routing of reconfigurable network based on ant algorithm

Finding the optimum path or routing always is an important and difficult issue in a practical dynamic network. In this paper, a new routing approach that due to multiple requirements in the reconfigurable network is briefly discussed. In order to obtain the optimum path between two nodes, we use the ant algorithm with which the problem can be attached to select the path. Simulation results shows that, especially having considered two factors of cost and delay, the proposed approach can be used to search the routing efficiently by the available nodes and paths provided with the reconstructed network topology even if the network changed.