Priority Mechanism for ant Colony Optimization in Network Routing

Abstract

Congestion, packet loss and increased response-time due to network traffic are common problems in most networks. This results in lowered network efficiency and poor Quality of Service (QoS). A number of routing protocols have been developed to deal with network traffic. The goal of every network routing protocol is to direct the traffic from source to destination maximizing the network performance. The Ant Colony Optimization (ACO) based routing protocol is efficient when used to dynamically route network traffic. Currently, there are many variations of the ACO algorithm in the domain of network routing. Past work has been done by researchers to improve the performance of the algorithm. In this paper we first study and analyze the existing work in this field and weigh the pros and cons of the different modifications and variations of the algorithm. We then propose a modification to the ACO algorithm in order to improve the quality of service offered by a network by routing packets according to their priority. Packets that belong to time-sensitive services like VOIP will be given higher priority and routed differently from low priority packets like FTP. By doing so the proposed algorithm will improve the success rate of the high priority packets while still maintaining high overall throughput of the network by dropping low priority packets that form loops. We then implement this algorithm on NS2 network simulator. The algorithm is then tested to see how it dynamically adapts to network changes. We then conduct tests to calculate the success rate and throughput that is offered by the algorithm and compare the results to those of other ACO algorithms. Our results indicate that the proposed algorithm improves the overall performance of the network by striking a balance between throughput and success rate thanks to the priority mechanism.