An improved ant colony optimization for the communication network routing problem

摘要

To propose an improved ant colony optimization (IACO) technique, which adapts a new strategy to update the increased pheromone, called the ant-weight strategy, and a mutation operation, to solve the communication routing problem (CNRP).A new IACO routing algorithm is proposed for communication networks. In this algorithm, each ant evaluates the quality of a route for its pheromone. The pheromone increment updating rule uses the ant-weight strategy. The simulation results indicate realization of a higher packet delivery ratio with lower communication cost with this algorithm. (6 refs.)Communication networks are classified as either circuit switched or packet switched. Circuit-switched networks are dedicated connections from source to destination which is made once at start-up and remains constant until the tear-down of the connection. Packet-switched networks have all their data to be transmitted, partitioned into segments and sent as a data packet. The data packets arrive out of order in a packet-switched network, with a variety of paths taken through different nodes in order to get to their destination. (The internet and office LAN are both good examples of packet-switched networks).