Abstract
AntNet is an ACO based routing algorithm for distributed and traffic adaptive multipath routing in wired best-effort IP networks. Forward ants in AntNet collect traffic behavior and backward ants are used to update probabilistic routing tables based on the collected information. Keywords—connectionless-network, mobile ants, traffic adaptive, multipath, network performance I. INTRODUCTION Internet has changed the face of lives of people turning them completely into modern. Internet is becoming an important tool in density; everybody across the world wants to connect to this fast source of information communication and gathering for their business or daily works. The internet is vast infrastructure of networked computers that have ability to share data around the world. Routing is one of the major parts of internet, routing is the process of selecting paths in a network along which data to be sent. Routing is the main characteristic of any network control system which strongly affects the network performance. There are two important parts of routing problem, the first one is communication structure which defines constrains and the second one is the traffic pattern which is dependent on the communication structure. So an ideal routing algorithm is one which is able to obtain an optimal solution by considering the specific temporal and spatial distribution of the input traffic and to deliver the packet to its destination with minimum amount of delay. It must be truly adaptive and intelligent enough to make the decision according to changing traffic condition. There are mainly two approaches for routing algorithms, distance-vector algorithms and link-state algorithms. The Open Short Path First is a shortest path algorithm is a link-state algorithm based on topology broadcast and is able to be fully and effectively adaptive with respect to topological modification, such that a link cost are static and may change only when network components become unreachable or new one comes up. Distance vector algorithms use the Bellman algorithm they do not make explicit use of global network topology and only use the notion of distance that is when a link becomes suddenly unavailable, in the worst case it might take infinite time to adjust the routing tables accordingly. The present routing algorithms are not sufficient enough to provide true adaptivity according to changing traffic patterns and very few algorithms make use of multipath. These are some basic reasons due to which Ant based routing is developed in recent years. The concept of
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call