Route Optimization With Ant Colony Optimization (ACO) : Finding the Shortest Path

ISBN-13: 9786202058070 / Angielski / Miękka / 2017 / 116 str.

Inam Khan

Opis

As different algorithms have different preferences or assumptions for the network configuration and traffic pattern, one of the challenges in designing our simulation is to select a typical set of network topology and parameters (link bandwidth, delay, and buffer size) so below is the network topology we will be using for the purpose of simulation. Some of the key aspects of the topology are mentioned below. We consider one hundred users connected via Switch to the Edge Router. We consider 25 routers connected to form an Internet / WAN cloud speaking Distance Vector, Link State, ACO and Session routing protocols. We have one server in this topology which is used to entertain users' requests. Normally we will discuss the Computer Networks Algorithm and protocols for finding shortest path using optimizations techniques like Genetic Algorithm, Particle Swarm Optimization, Ant Colony optimization will clearly discuss the importance of their comparison results.

O autorze

Inam Ullah Khan is an active lecturer and researcher in electrical engineering, Software Engineering and computer science. His research specialization is shortest path finding and optimization techniques. He has won various teaching and research awards at some Universities and International Conferences.