|
|||
|---|---|---|---|
Genesis of DB Routing Algorithm in Unicasting Networks S.Anuradha, G.Raghu Ram, K.E.Srinivasa Murthy, V.Raghunath Reddy and B.Sathynarayana
G.Pulla Reddy Engineering College,
Sri Krishnadevaraya University,
Kurnool 518002 AndhraPradesh India
Abstract
Ant colony is
successfully used nowadays to solve difficult
optimization problems such as traveling salesman (TSP),
quadratic assignment (QAP), and satisfiability problem.
The objective of the research presented in this paper is
to adapt an improved searching technique of Ant Colony
Optimization (ACO) algorithm, mainly, The DB routing
algorithm to improve the transmission speed of data
packets. DB routing algorithm (an Ant Algorithm which
uses both Depth wise and Breadth wise searching
techniques), a novel approach to routing optimization of
flows in connection-oriented computer networks. The
problem considered arises naturally from several
optimization problems that have recently received
significant attention. The proposed DB routing is an ant
algorithm motivated by recent works on the application
of the ant algorithm to solving various problems related
to computer in connection-oriented networks. We analyze
the major Characteristics of the DB routing and explain
its performance. We report results of experiments over
different network topologies and different sizes.
Keywords DB routing, DFS, BFS, Ant colony optimization, Pheremonetrail.
(
BibTex: @ARTICLE{P1140916723,
AUTHOR = {S.Anuradha and
G.Raghu Ram and K.E.Srinivasa Murthy and
V.Raghunath Reddy and B.Sathynarayana},
TITLE = {Genesis of DB Routing Algorithm in Unicasting Networks}, JOURNAL = {ICGST International Journal on Computer Network and Internet Research, CNIR}, YEAR = {2009}, MONTH={July}, VOLUME = {09}, ISSUE = {I}, PAGES= {47--55} }
( |
|||
|
Full
Paper
