Colony based routing culture algorithm for internet traffic optimization

The Internet has grown and changed ever since the first connections were made in 1969. The problem of routing assignments has been one of the most intensively studied areas in the fields of Data Communication Network. Network Routing essentially consists of two entities named Routing Protocol and Routing Algorithm. The Routing Protocol provides each node in a network, a consistent view of the topology and the Routing Algorithm provides the intelligence to compute paths between nodes. The basic routing algorithm used in data communication like link state routing which uses Dijkstra for minimum path calculation transfers all the received packets from the previous router to the next router of minimum cost function which makes the algorithm simpler but increases the overall response time from source to destination.

The present work proposes a civilized colony based culture of routing with objective to improve the response time from source to destination in many cases. The proposed scheme divides the whole network of routers into civilized colonies with a head each. All the members of a colony may communicate to each other directly and head of colony communicate with members of other colony. All the intermediate routers in the path of the packet are not decision place in case of civilized colony based routing culture algorithm, the decision takes place only at the source router or the intermediating colony head and in such a way the overall processing time is improved.

This new algorithm is implemented on various cases and compared with the link state Dijkstra algorithm for total processing time. It is observed that the percentage improvement in total processing time is 75% to 85% when the numbers of routers in a colony are 13 to 50.