Browse > Article

A study on link-efficiency and Traffic analysis for Packet-switching using the link state algorithm  

황민호 (군산대학교 공과대학원 전파공학과)
고남영 (군산대학교 공과대학 전자정보공학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.6, no.1, 2002 , pp. 30-35 More about this Journal
Abstract
Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 이재규,'C로 배우는 알고리즘', 세화, pp.824 1. 2001
2 Craig Hunt,'TCP/IP Network Administration', O'Relly, pp.20-68, 3.1999
3 CACI,'ComnetⅢ Reference guide', CACI, 11. 1999
4 http://telcom.semyung.ac.kr/shikm/lectures/computernetwork/199802/lecture4_2.htm
5 김한규, 박동선, 이재광, '데이터통신과 네트워킹', 교보문고, pp.530-550, 2.2001
6 Sun microsystems,' Solaris Operating Environ ment TCP/IP Network Administration', Sun education center, pp.6:1-6:88, 11.2000
7 에릴홀,' Internet Core Protocols', O'Relly, pp.54-401, 10.2000
8 http://www.ece.nwu.edu/-guanghui/Transporta tion/spt/section3_2.html