Open Access Open Access  Restricted Access Subscription or Fee Access

Fast Transfer of Packets Through DB Routing Using Ant Colony Optimization

(*) Corresponding author

Authors' affiliations



Routing in computer network is an essential functionality, which influences both the network management as the quality of services in global networks. The management of the traffic flows has to satisfy requirements for volume of traffic to be transmitted as avoidance of congestions for decreasing the transmission delays. These two requirements in general are contradictory. The optimal traffic management is a key issue for the quality of the information services. This Paper presents Depth wise Breadth wise (DB) algorithm, which provides a path to an incoming packet much faster than existing routing algorithms. This is basically an Artificial Intelligence (AI) Concept, which is useful to get from the source to the destination. Moreover, the proposed algorithm is a combination of Depth First search (DFS) and Breadth First Search (BFS) searching techniques. In this paper, DB Routing has been developed based on a general-purpose metaheuristic named Ant Colony Optimization, which is a framework for building ant-inspired algorithms. DB is applied as the routing algorithm in a simulated packet-switched point-to-point network. It is investigated whether DB is able to obtain an increase in throughput when packets are sent between two distinct nodes. Moreover, it is investigated how prioritizing different heuristics effect the quality of the routing performed. It is concluded that DB behaves differently depending on the relative priority of positive feedback negative feedback and local heuristics. Also it is possible to adjust the parameters to achieve best results by improving in routing time.
Copyright © 2018 Praise Worthy Prize - All rights reserved.


Ant Algorithms; Ant Colony Optimization; Positive Feedback; Negative Feedback; Routing; Met Heuristics and Network Model

Full Text:



Bonabeau, E., Dorigo M. & Theraulaz G, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, 1999.

Bonabeu E. & Théraulaz G, Swarm smarts, Scientific American, pp. 72-79, March, 2000.

White, T., Routing with Swarm Intelligence, Technical Report SCE-97-15, Systems and Computer Engineering, Carleton University, 1997.

Bonabeau, E., Dorigo M. & Theraulaz G, Ant algorithms and stigmergy, FGCS 16 pp. 851-871, 2000.

Colorni, A., Dorigo M. & Maniezzo V, Ant System – An Autocatalytic Optimizing Process, Technical Report IRIDIA/1991-016, Italy: Politecnico di Milano, 1991.

Colorni, A., Dorigo M. & Maniezzo V, The Ant System: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics-part B, Vol. 26, No.1, pp.1-13, 1996.

Di Caro, G. & Dorigo M, Ant colonies for Adaptive Routing in Packet-switched Communications Networks, Parallel Problem Solving from Nature, pp. 673-682, 1998.

Di Caro, G., Dorigo M. & Gambardella L. M, Ant Algorithms for Discrete Optimization, Artificial Life 5(2) pp. 137-172, 1999.

Di Caro, G., Dorigo M. & Stuetzle T, Guest editorial – Ant algorithms, FGCS 16 pp. v-vii, 2000.

Dorigo, M. & Gambardella L. M, Ant Colonies for the Travelling Salesman Problem, Technical Report IRIDIA/1996-3, Belgium: Université Libre de Bruxelles, 1997.

Dorigo, M. & Stuetzle T, The ant colony optimization metaheuristic: Algorithms, applications and advances”, Technical Report IRIDIA/2000-32, Belgium: Université Libre de Bruxelles, 2000.

Gutjahr, W. J, Graph-based Ant System and its convergence”, FGCS 16 pp. 873-888, 2000.

V. Laxm, Ant Colony Optimization based Routing on ns-2*, Proc. On WCSN 2006.

Mitchell, T. M, Machine Learning, Singapore: MacGraw-Hill, 1997.

Tannenbaum, A. S, Computer Networks (Third Edition), Prentice Hall, 1996.

Cormen, T. H., Leiserson C. E., Rivest R. L. & Stein C, Introduction to Algorithms (Second Edition), MIT Press/McGraw-Hill, 2001.


  • There are currently no refbacks.

Please send any question about this web site to
Copyright © 2005-2023 Praise Worthy Prize