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
- EP ID EP139837
- DOI -
- Views 118
- Downloads 0
STUDY AND PERFORMANCE ANALYSIS OF THE WYLLIE’S LIST RANKING ALGORITHM USING VARIOUS PARALLEL PROGRAMMING MODELS
The Wyllie’s list ranking algorithm takes a linked list data structure as an input and it pass the linked list successor elements to the succ1 array to find the Rank. The algorithm depends upon the Pointer jumping operat...
A NOVEL ROUTING ATTACK IN MOBILE AD HOC NETWORKS
Mobile ad hoc networks will often be deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susce...
A SECURITY FRAMEWORK FOR AN ENTERPRISE SYSTEM ON CLOUD
Enterprise systems provide integrated information for all activities in an organization. These systems serve as a vital asset to any organization and hence it becomes mandatory to ensure their security. Information secur...
Improving the QOS in Video Streaming Multicast
In a streaming video multicast environment a large number of users often request various similar processing on the same stream. Therefore service sharing is feasible, with a large potential of savings in processing cost....
Analysis and evaluation of Feature selectors in opinion mining
Computational performance is improved by use of basic feature selection in most of the research works. Sentiment analysis identifies whether opinion expressed on a topic in a document is positive or negative. But many po...