Computer network load-balancing and routing by ant colony optimization

A high efficient design of computer network is an important issue for the high transmission speed requirement of today. In computer network, the data packages have to be transmitted to the destination with a minimum delay for ensuring the quality of service guarantees. This work presents an algorithm to perform a dynamic load-balancing for transmitting the data packages with near minimum delays in the interconnection networks. The proposed algorithm is based on the ant colony optimization algorithm inspired by the simple behavior of biological ants. This work utilizes a cube topology network to evaluate the performance of the proposed algorithm. From the comparing results, the proposed algorithm can achieve good network utilization by the low rate of the bandwidth blocking.