GENETIC ALGORITHM FOR DISTANCE VECTOR ROUTING TECHNIQUE
M.Roberts Masillamani1, Avinankumar Vellore
Suriyakumar2, Rajesh Ponnurangam2 and G.V.Uma3
1Dean, Computing Sciences, Computer Science Department,
Hindustan College of Engineering affiliated to Anna
University, P.O.Box No.01, Padur, Kelambakkam-605103
TamilNadu,India. Tel: +91-4114-27474262/27474395
2Final Year, Bachelor of Engineering in Computer Science
and Engineering, Computer Science Department Hindustan
College of Engineering affiliated to Anna University,
P.O.Box No.01, Padur,, Kelambakkam-605103
TamilNadu,India. Tel: +91-4114-27474262/27474395
3Assistant Professor, Department of Computer Science and
Engineering
College of Engineering, Guindy, Chennai, TamilNadu,
India
Abstract:
Routing packets from the source to the destination machine
is the fundamental function of the network layer. Modern
computer networks generally use dynamic routing algorithms
rather than the static ones. Two dynamic algorithms in
particular, Distance vector routing and Link state routing,
are the most popular. In this paper, the optimization of
distance vector routing technique using genetic algorithm,
is being proposed. Distance
vector routing technique causes congestion, as all the
routing tables of the routers connected in the network needs
to be refreshed after a stipulated time interval. The
proposed technique minimizes the congestion by reducing the
number of ECHO packets transmitted and uses genetic
algorithm to optimize the path selection.
Keywords:Distance
vector routing technique, Genetic algorithm, Congestion,
ECHO packet, AODV
( Full Paper
300KB)
BibTex:
@ARTICLE{P1120625107,
AUTHOR = {M.Roberts
Masillamani and Avinankumar Vellore Suriyakumar and
Rajesh Ponnurangam and G.V.Uma},
TITLE = {GENETIC ALGORITHM FOR DISTANCE VECTOR ROUTING TECHNIQUE},
JOURNAL = {The International Journal of Artificial Intelligence and Machine Learning},
YEAR = {2006},
VOLUME = {6},
ISSUE ={2},
PAGES={59--62}
}
(Full Paper
300KB)
|
