International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

Routing Algorithms in Networks

Author Affiliations

  • 1Dept. of Computer Science, St. Paul’s College of Arts and Science for Women, Coimbatore, INDIA

Res. J. Recent Sci., Volume 3, Issue (ISC-2013), Pages 1-3, (2014)


Network is defined as a group of two or more computer systems which are linked with each other. It allows computers to exchange data from each other along the data connections. Routing is a process of selecting path in a network along which the packets are sending over the network traffic. There are many routing algorithms which are used to determine the path, load, and distance over the network traffic. In this paper, a routing algorithm is taken as a tool for making an analysis over the research work done in network algorithms. Routing algorithms are classified as adoptive routing algorithms and non adoptive routing algorithms. An adoptive routing algorithm is an algorithm in which the network path can changes their routing ways s in accordance to the changes taken place in the network topology and in the traffic. It is having a dynamic routing table in which it sends data over the network. Distance vector routing algorithm, link state routing algorithm, distributed routing algorithms are comes under the category of adoptive routing algorithms. The non adoptive routing algorithms are the algorithms in which it follows a static routing table for the data to allow transmission over the network. This algorithm does not adjust with the current traffic and the network topology. Shortest path routing, flooding algorithms are comes under the category of non adoptive routing algorithms. In this paper, an analysis is made over the routing algorithms such as between the adoptive routing algorithms and the non adoptive routing algorithms. The results are favored to the adoptive routing algorithms in which the researchers can easily find the best routing path in a traffic over the network since it adjusts to network when compared with non adoptive routing algorithms. The researchers opt this because of the dynamic routing table. The results of the efficiency of the adoptive routing algorithms are better when compared to the non adoptive routing algorithms. The results concluded in this paper that the adoptive routing algorithms give best routing path when compared to the non adoptive routing algorithms in the networks.


  1. Nilesh P. Bobade, Performance Evaluation of Ad Hoc on Demand Distance Vector in MANETs with varying Network Size using NS-2 Simulation, (IJCSE) International Journal on Computer Science and Engineering,02(08), 2731-2735 (2010)
  2. Teressa Longjam and Neha Bagoria, Comparative Study of Destination Sequenced Distance Vector and Ad-hoc Ondemand Distance Vector Routing Protocol of Mobile Ad-hoc Network” International Journal of Scientific and Research Publications, 3(2), ISSN 2250-3153 February (2013)
  3. Revathi Venkataraman, Pushpalatha .M, and Rama Rao.T, Performance Analysis of Flooding Attack Prevention Algorithm in MANETs, World Academy of Science, Engineering and Technology,32(2009)
  4. Venkateshwara Rao .K, Dynamic Search Algorithm used in Unstructured Peer- to-Peer Networks, International Journal of Engineering Trends and Technology,2(3), (2011) 25.00c (2008)
  5. Cheolgi Kim, Young-Bae Koy and Nitin H.Vaidya, LinkState Routing Protocol for Multi-Channel Multi-Interface Wireless Networks, IEEE (978–1–4244–2677– 5/08)/$25.00c (2008)
  6. Kiruthika R., An exploration of count-to-infinity problem in networks” International Journal of Engineering Science and Technology, 2(12), 7155-7159 (2010)
  7. Mohammad reza soltan aghaei, A hybrid algorithm for finding shortest path in network routing, Journal of Theoretical and Applied Information Technology © 2005-2009 (2009)
  8. Taehwan Cho,A Multi-path Hybrid Routing Algorithm in Network Routing, International Journal of Hybrid Information Technology, 5(3),(2012)