• Jun 14, 2017 News!Vol.8, No.5 has been indexed by EI (Inspec).   [Click]
  • Nov 09, 2017 News!Vol.9, No.5 has been published with online version. 16 peer reviewed articles from 11 specific areas are published in this issue.   [Click]
  • Jul 19, 2017 News!Vol.9, No.4 has been published with online version. 16 peer reviewed articles from 16 specific areas are published in this issue.   [Click]
General Information
Editor-in-chief
Prof. Wael Badawy
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2009 Vol.1(4): 409-412 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2009.V1.65

Link State Generation Using Antnet Algorithm

D. N. Mallikarjuna Rao and V. Kamakshi Prasad

Abstract—Foraging behaviour of the ants is used for solving various problems in Computer Science. Foraging behaviour is one in which food is searched for by insects by exploring the environment in parallel. We take the example of ants’ foraging behaour in our paper. The ants coordinate in indirect form by depositing a chemical substance called pheromone. The other ants follow the path with the help of the pheromone trails. We use 2ACO (Ant Colony Optimization) for discovering the routes in a communication network. Ant Net1 is one of the approaches to adaptive learning of routing tables in wide area best-effort datagram networks. In this algorithm two types of ants are generated viz. Forward ant and Backward ants. While travelingfrom a source to a destination the forward ants store, in their memory, the paths and of the traffic conditions they encounter. After reaching the destination the forward ant transfers its memory to the backward ant and dies. The backward ant retraces the path traversed by the forward ant and updates the routing tables in the path. In this paper we combine the concepts of Antnet algorithm and Link state algorithm. In the 3 Link State algorithm, periodically each router discovers its neighbours and finds their network addresses, measures the cost to approach each neighbour, constructs a packet containing the information it has found from the neighbours and sends this packet to all other routers in the network. Each router which gets the information from every node about its neighbours computes the shortest path. Ant Net is designed in such way that the forward ants carry the information about the status of the links it traverses. This status information can be captured and can be used to find the best path. We use the dijsktra algorithm to find the best path after capturing the information about all the links.

Index Terms—forward ants, backward ants, Djkstra, Link state.

Final paper submitted on 26.06.2009 by D. N. Mallikarjuna Rao and Dr. V. Kamakshi Prasad

[PDF]

Cite: D. N. Mallikarjuna Rao and Dr. V. Kamakshi Prasad, "Link State Generation Using Antnet Algorithm," International Journal of Computer Theory and Engineering vol. 1, no. 4, pp. 409-412, 2009.

Copyright © 2008-2015. International Journal of Computer Theory and Engineering. All rights reserved.
E-mail: ijcte@vip.163.com