Comparing the Routing Performances of the AntNet-CL and AntNet-Co Algorithms in a Datagram Network

in recent years, communication networks have garnered rapt attention due to the unprecedented growth of the Internet in the past decades, whereby it has evolved into a communication infrastructure. It could also be stated the Internet owes its success primarily to its connectionless packet switching technology. The present research was, therefore, an attempt to compare the performances of two ant colony routing algorithms, namely Ant-Net-Co and Ant-Net-CL, in a datagram network. The following parameters were used to compare the proposed algorithms: the death times of the first and last nodes, packet delivery rate, delay, routing overload, lost data, and throughput rate. The simulation results revealed that AntNet-Cl considerably outperformed the AntNet-Co algorithm. The simulations of the mentioned algorithms were carried out in NS-2 in this research.

Keywords:

ant colony algorithm , datagram network , routing network