한국정보통신학회논문지 (Journal of the Korea Institute of Information and Communication Engineering)

  • 제6권1호
  • /
  • Pages.36-40
  • /
  • 2002
  • /
  • 2234-4772(pISSN)
  • /
  • 2288-4165(eISSN)
한국정보통신학회 (The Korea Institute of Information and Commucation Engineering)
권호 표지

최적의 라우팅을 위한 RIP와 EIGRP 트래픽 분석 연구

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

  • 이재완 (군산대학교 공과대학 전자정보공학부) ;
  • 고남영 (군산대학교 공과대학 전자정보공학부)
  • 발행 : 2002.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. 이재규,'C로 배우는 알고리즘', 세화, pp.824 1. 2001
  2. 김한규, 박동선, 이재광, '데이터통신과 네트워킹', 교보문고, pp.530-550, 2.2001
  3. http://www.ece.nwu.edu/-guanghui/Transporta tion/spt/section3_2.html
  4. http://telcom.semyung.ac.kr/shikm/lectures/computernetwork/199802/lecture4_2.htm
  5. 에릴홀,' Internet Core Protocols', O'Relly, pp.54-401, 10.2000
  6. Craig Hunt,'TCP/IP Network Administration', O'Relly, pp.20-68, 3.1999
  7. Sun microsystems,' Solaris Operating Environ ment TCP/IP Network Administration', Sun education center, pp.6:1-6:88, 11.2000
  8. CACI,'ComnetⅢ Reference guide', CACI, 11. 1999