Introduction of Routing and its Types
 |
International Journal of Computer Trends and Technology (IJCTT) |  |
| © 2018 by IJCTT Journal | ||
| Volume-62 Number-2 |
||
| Year of Publication : 2018 | ||
| Authors : Er.Navneet Kaur | ||
| DOI : 10.14445/22312803/IJCTT-V62P111 |
MLA Style: Er.Navneet Kaur "Introduction of Routing and its Types" International Journal of Computer Trends and Technology 62.2 (2018): 80-83.
APA Style:Er.Navneet Kaur (2018). Introduction of Routing and its Types International Journal of Computer Trends and Technology, 62(2), 80-83.
Abstract
A computer network is a set of computers that are connected together the purpose of sharing resources and information. The most common resource shared today is an Internet. Routing is an important function of computer network. Routing is process of established the routes that data packets must follow to reach the destination. This paper discussed the various routing algorithms that are adaptive and non-adaptive routing algorithms.
Reference
[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 Adhoc Network” International Journal of Scientific and Research Publications, 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) .
[5] Mohammad reza soltan aghaei, "A hybrid algorithm for finding shortest path in network routing", Journal of Theoretical and Applied Information Technology © 2005- 2009 (2009).
[6] 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).
[7] Beaubrun R, Pierre S, “Routing algorithm for distributed communication networks,” Proc 22nd IEEE Conference on Computer Networks,LCN 97 pp. 99- 105 Nov 1997
[8] Thomas H. Cormen, Charles E. Leiserson,Ronald L.Rivest, and Clifford Stein.Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 24.1: TheBellman-Ford algorithm, pp.588–592. Problem 24-1, pp.614–615.
[9] R. Bellman. On a routing problem.Quar . Appl. Math., 16:87- 90, 1958.
[10] Adaptive Routing Algorithms in Distributed Networks, K.Rangaswamy & G. Sreenivasulareddy.
[11] Computer network, S.Tanenbaum, fourth edition, Pearson education.
[12] Vahdat A and Becker D, “Epidemic routing for partially connected ad hoc network”, IEEE journal on Selected Areas in Communications,2003.
[13] Hang Y, Jain S, Martonosi M, and Fall K, “ Erasure coding based routing for opportunistic network”, In ACM SIGCOMM Workshop on Delay Tolerant Network, 2005.
Keywords
computer network, routing, adaptive and non-adaptive, algorithm, path.