Ant Colony Optimization Based Compact Routing for Networks
Citation
Deepti Srivastava, Uday Singh "Ant Colony Optimization Based Compact Routing for Networks", International Journal of Engineering Trends and Technology (IJETT), V30(6),322-326 December 2015. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
Abstract
Network is an amalgamation of PCs and differed equipment gadgets that are joined by method for a channel of correspondence which empower the trading of data and assets. The methodology of selecting a way for exchanging is known as routing. There are numerous routing calculations which have been effectively executed. One variation of routing is compact routing wherein the point is to perform system minimizing so as to route the extent of the routing table. Compact Routing puts cutoff points on routing versatility. Routing list that can likewise be termed as the Routing Information base (RIB) is fundamentally an information table that is put away inside of a switch or a PC that is arranged that gives the rundown of courses to a particular destination system alongside a couple cases and separations related with these courses. The routing list additionally comprises of the system topology around it. This work obtains ideas of swarm knowledge in view of Ant colony optimization to plan a Compact routing calculation that store a little measure of data in a routing list at every hub in a system, and give a bound on the stretch of informing courses.
References
[1] Computational Intelligence-An Introduction Second Edition- Andries P.Engelbrecht University of Pretoria South Africa.
[2] Wolfson School of Mechanical and Manufacturing Engineering Lough borough University, Lough borough, Leics LE11 3TU http://www.primetechnologywatch.org.uk (ISBN 1-84402-020-7), 2002
[3] Miko Elwenspoek “Proceeding of Sensor Technology 2001 held in Enschede, The Netherland, 14-15 May 2001”
[4] A. Doria, E. Davies, and F. Kastenholz (Edts.). Requirements for inter-domain routing. IRTF, Internet Draft, 2006.
[5] On Compact Routing for the Internet Dmitri Krioukov, CAIDA This email address is being protected from spambots. You need JavaScript enabled to view it. ,kc claffy, AIDA,This email address is being protected from spambots. You need JavaScript enabled to view it. Kevin Fall Intel Research This email address is being protected from spambots. You need JavaScript enabled to view it. Arthur Brady Tufts University This email address is being protected from spambots. You need JavaScript enabled to view it..
[6] D. Peleg and E. Upfal. A trade of between size and efficiency for routing tables. J. of the ACM, 36:510{530, 1989}
[7] Compact Routing in Directed Networks with Stretch Factor of Two Punit Chandra and Ajay D. Kshemkalyani Dept. of Computer Science University of Illinois at Chicago, Chicago, IL 60607-7053, USA.
[8] HS.K.&K D.K., Introductory operations research (theory and applications), 2003
[9] M. Tim Jones, Artificial intelligence application programming, 2nd edition,2006
[10] Http://www.swarmintelligence.org/tutorials.php,
[11] Qi Shen,Jian-HuiJiang, Chen-Xu Jiao, Shuang-Yan Huan, Guo-liShen, and Ru-Qin Yu, Optimized partition of minimum spanning tree for piecewise modeling by particle swarm algorithm, 2004
[12] Ammar W. Mohemmed, Nirod Chandra Sahoo& Tim Kim Geok, Solving shortest path problem using particle swarm optimization, 2008
[13] James Kennedy & Russell Eberhart, Particle swarm optimization, 1995
[14] Han Huang Z.H., Particle swarm optimization algorithm for transportation problems, 2009
Keywords
swarm intelligence, collective intelligence algorithm, compact routing.