Paper Details: Downloads: 561
Serial Number: P1140916723
Title: Genesis of DB routing Algorithm in Unicasting Networks
Authors: S.Anuradha and G.Raghu Ram and K.E.Sreenivasamurthy and V.Raghunath Reddy and B.Sathyanarayana
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, Positive Feedback, Negative Feedback, Ant colony optimization, Pheremonetrail
Journal/Conference: International Journal of Computer Networks and Internet Research
Volume: 9
Issue: 1
Submission Date: 4/13/2009 12:00:00 AM
Review Date: 5/12/2009 12:00:00 AM
Publishing Date: 6/24/2009 12:00:00 AM
Article Downloads: 561
Download:

Facebook