Coarse-Grained ParallelGeneticAlgorithm to solve the Shortest Path Routing problem using Genetic operators

Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 1

Abstract

In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computation time reduction along with the use of migration scheme. This algorithm is developed and implemented on an MPI cluster. The effects of migration and its performance is studied in this paper.

Authors and Affiliations

V. PURUSHOTHAM REDDY , G. MICHAEL , M. UMAMAHESHWARI

Keywords

Related Articles

STUDY OF BLUETOOTH WIRELESS TECHNOLOGY USING JAVA

Bluetooth is a wireless communication protocol. Since it's a communication protocol, we can use Bluetooth to communicate to other Bluetooth-enabled devices. In this sense, Bluetooth is like any other communication protoc...

A Methodology for Template Extraction from Heterogeneous Web Pages

The World Wide Web is a vast and most useful collection of information. To achieve high productivity in publishing the web pages are automatically evaluated using common templates with contents. The templates are conside...

A Technique to improve Security of Data in Multilevel Trust

The Privacy Preserving Data Mining technique that is used widely to conserve security of data is a random perturbation method. The original data is modified and many copies are created according to the trust levels in ea...

DATA DELIVERY PREDICTABILITY IN INTERMITTENTLY CONNECTED MANETS

Network that functions without any infrastructure is said to be Mobile Ad Hoc networks (MANETs). Each node present in this network chooses any route and moves autonomously. At the same time rely on upon each other to sen...

Numerical Simulation of one dimensional Heat Equation: B-Spline Finite Element Method

The comprehensive numerical study has been made here for the solution of One dimensional heat equation the Finite Element method is adopted for the solution with B-spline basis function the important finding of the prese...

Download PDF file
  • EP ID EP139837
  • DOI -
  • Views 127
  • Downloads 0

How To Cite

V. PURUSHOTHAM REDDY, G. MICHAEL, M. UMAMAHESHWARI (2011). Coarse-Grained ParallelGeneticAlgorithm to solve the Shortest Path Routing problem using Genetic operators. Indian Journal of Computer Science and Engineering, 2(1), 39-42. https://europub.co.uk/articles/-A-139837