Browse > Article

A study on the traffic analysis of RIP and EIGRP for the most suitable routing  

이재완 (군산대학교 공과대학 전자정보공학부)
고남영 (군산대학교 공과대학 전자정보공학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.6, no.1, 2002 , pp. 36-40 More about this Journal
Abstract
Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.
Keywords
RIP; EIGRP;
Citations & Related Records
연도 인용수 순위
  • Reference
1 http://www.ece.nwu.edu/-guanghui/Transporta tion/spt/section3_2.html
2 http://telcom.semyung.ac.kr/shikm/lectures/computernetwork/199802/lecture4_2.htm
3 Sun microsystems,' Solaris Operating Environ ment TCP/IP Network Administration', Sun education center, pp.6:1-6:88, 11.2000
4 CACI,'ComnetⅢ Reference guide', CACI, 11. 1999
5 Craig Hunt,'TCP/IP Network Administration', O'Relly, pp.20-68, 3.1999
6 이재규,'C로 배우는 알고리즘', 세화, pp.824 1. 2001
7 김한규, 박동선, 이재광, '데이터통신과 네트워킹', 교보문고, pp.530-550, 2.2001
8 에릴홀,' Internet Core Protocols', O'Relly, pp.54-401, 10.2000