• Title/Summary/Keyword: OSPF Routing Protocol

Search Result 28, Processing Time 0.024 seconds

Packet Processing Analysis of OSPF Routing Protocol (OSPF라우팅 프로토콜의 패킷 처리 분석)

  • 최승한;주성순
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.477-480
    • /
    • 2000
  • Open Shortest Path First(OSPF) is a dynamic, hierarchical routing protocol designed to support routing in TCP/IP networks. Currently, OSPF is used as Interior Gateway Protocol(IGP) in many routers. In this paper, we analyze the variation of number of OSPF routing packets in case of changing the network configuration. The results show that the number of packets in case of adding new link increase five times than one in case of normal operation.

  • PDF

Algebraic Formal Specification and Formal Validation of the Standard and an Implementation of the OSPF Protocol (OSPF Protocol 표준 및 구현의 대수 정형적 명세 및 정형적 검증)

  • 박재현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.360-374
    • /
    • 2004
  • The OSPF protocol is the most widely used Interior Gateway Routing Protocol. Therefore, for the reliability of behavior of gigabit swiching routers, it is essential to guarantee the interoperability and the safety of the OSPF protocol. In this paper, we analyze the standard document of the OSPF protocol, so that we provide a formal specification that specifies the protocol behaviors by detailed design level using the algebraic formal method. By referring available source codes of the OSPF protocol, we supplement the formal specification to express more detailed behaviors that is not specified definitely in the standard. We also formally verify the interoperability and the safety of the protocol state machine of the specification. By showing that the formal specification specify all of the states and the transition events that appear in the standard document of the OSPF protocol, we prove that the state machine has the completeness, and prove it has the interoperability. To prove that the specification of the protocol has the safety, we formally verify the reachability, the liveness, the livelock-free property, and the deadlock-free property. As a result, we prove the protocol has the consistency. The specification and the validation are also effective to the OSPF Version 3 that inherit the protocol mechanism of the OSPF Version 2.

A Study on OSPF for Active Routing in Wireless Tactical Communication Network (전술통신망에서 능동적 라우팅을 위한 OSPF에 대한 연구)

  • Lee, Seung-Hwan;Lee, Jong-Heon;Lee, Hoon-Seop;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1211-1218
    • /
    • 2010
  • OSPF is the optimized routing protocol in wired network and considered as a tactical routing protocol in wireless tactical communication network. However because it is designed basically based on wired environment, it runs inadequately in wireless tactical environment: noise and jamming signal. So, we proposed new OSPF cost function to develop active routing protocol in wireless tactical communication network. In redefined cost function, there are four parameters that are relative transmission speed, link weight, router utilization, link average BER(Bit Error Rate). These parameters reflect wireless tactical characters. Also, we remodel the option field in Hello packet. It can help user to periodically check the link state. From the simulation result, it is shown that proposed OSPF is better than OSPF in jamming situation and has accumulative delay gain with dispersion of traffic load in entire network.

The Case Study for Path Selection Verification of IGP Routing Protocol (IGP 라우팅 프로토콜의 경로선택 검증을 위한 구현 사례)

  • Kim, No-Whan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.197-204
    • /
    • 2014
  • RIP, EIGRP, OSPF are the interior gateway protocol for sending and receiving routing information among routers in AS(Autonomous System). Various path selection methods using the metric in regard to them have been studied recently but there are few examples that the contents learners understand theoretically are verified by the practice. The Best Path is determined by calculating the Cost value based on the relevant topology of each routing protocol. After implementing the virtual network, it is certain that the results tracking and verifying the relevant path selection of each routing protocol are consistent with the Best Path. If methods suggested in this paper are applied properly, the relevant path selection process of routing protocol can be understood systematically. And it is expected that the outstanding results of learning will be able to be achieved.

A Study on OSPF for Wireless Tactical Communication Networks (무선 전술 통신망을 위한 OSPF 적용 방안)

  • Kook, Sung-Sook;Chang, Moon-Jeong;Lee, Mee-Jeong;Jun, Je-Hyun;Kim, Tae-Wan;Choi, Jeung-Won;Roh, Bong-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.109-121
    • /
    • 2010
  • Recently, the military of Korea has been establishing the next generation wireless tactical communication system so called Tactical Information Communication Network (TICN). A routing protocol for TICN transport networks has to be able to select a path with high survivality, reliability, and stability while accommodating as many flows as possible with minimum QoS guarantees. The OSPF(Open Short Path First) used widely is determined to be the routing protocol for TICN. With the typical deployment practices OSPF, however, it cannot satisfy the requirements of TICN. In this paper, we propose a cost function for OSPF and a way to tune the OSPF protocol parameters for the TICN transport networks. Through simulations, it is shown that the OSPF with the proposed cost function provides better performance than the OSPF in terms of both the services provided to the applications and the network resources utilization.

Efficient Flooding Methods for Link-state Routing Protocols (Link-state 라우팅 프로토콜을 위한 효율적인 플러딩 방법)

  • Kim, Jeong-Ho;Lee, Seung-Hwan;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.760-766
    • /
    • 2012
  • In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.

Improvement of IS-IS Protocol for TICN Tactical Backbone (TICN 전술백본망을 위한 IS-IS 프로토콜 성능 개선)

  • Kwon, Tae-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.8B
    • /
    • pp.996-1002
    • /
    • 2011
  • Recently Korea Army are developing the TICN(Tactical Information Communication Network) which is the next army tactical communication system. The TICN tactical backbone's ability is very important. So analysis of the standard protocol for the data transmission guarantee are obliged. For the TICN tactical backbone, previous paper analysed routing protocol efficiency index and compared to superiority of the OSPF and IS-IS protocols in the tactical environment. Conclusively IS-IS protocol was more suitable for TICN backbone routing protocol. As follow-up study of previous paper, this paper try to find the proper parameters of IS-IS protocol in order to improve the performance of IS-IS protocol as a TICN tactical backbone protocol under the tactical environments. Finally it selected four time-parameters of IS-IS protocol, those can improve performance of the protocol.

OSPF Protocol Extension and Active Packet Delivery Scheme for IP Networks with Active Routers (능동 라우터를 가진 IP 네트워크를 위한 OSPF 프로토콜의 확장 및 능동 패킷 전달 방식)

  • 안상현;김경춘;한민호;나중찬
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.126-133
    • /
    • 2003
  • The existing active routing Protocols assume that the active network topology is static or pre-configured. However a dynamic mechanism to route an active Packet according to the network condition is required due to the dynamic characteristic of the active network. As active routing protocols, SLRP and TCOM500 PLAN project have been proposed, but since both of them are based on the assumption of the static topology we can not say that they are dynamic routing protocols in their entirety. Therefore, in this paper, we propose a new active network routing protocol, called AOSPF (Active Open Shortest Path First), which is compatible with the existing IP routing protocol. AOSPF is an extension of OSPF by adding a new LSA (Link State Advertisement) to allow the active network routing. The newly introduced LSA is used to specify whether the corresponding router is an active router or not. and one bit in the OPTION field of an LSA packet is used as the active router indication bit. This way of extending OSPF is similar to the scheme used in the extension of OSPF for multicast, i.e., MOSPF. In this paper, we will present the operation of AOSPF and the way how an active packet is forwarded based on the active network topology information constructed by AOSPF.

Analysis of Routing Protocol for Tactical Backbone of TICN (TICN 전술백본망을 위한 라우팅 프로토콜 분석)

  • Jang, Dong-Ki;Kwon, Tae-Wook
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.4
    • /
    • pp.650-658
    • /
    • 2010
  • Recently Korea Army developed the TICN which is the next army tactical communication system. The TICN will support ability from under environment, strategy maneuver communication system of integrated army dimension overcome and NCW. If the IER(Information Exchange Requirement) phases 3 of the future application system, the analysis that a transmission ability of the TICN is the uncapable is govern. The TICN tactical backbone's ability is very important. Therefore, network efficiency index in application and analysis of the standard protocol for the data transmission guarantee are obliged. For the TICN tactical backbone, this paper analyzes of routing protocol efficiency index and compares to superiority of the OSPF(v2) and integrated IS-IS protocols in the tactical environment. Conclusively we proposed that integrated IS-IS protocol is more suitable for TICN backbone routing protocol.

Implementation of Embedded Educational Router System (임베디드 교육용 라우터 실습장비의 구현)

  • Park, Gyun Deuk;Chung, Joong Soo;Jung, Kwang Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.5
    • /
    • pp.9-17
    • /
    • 2013
  • This paper presents the design of the educational router system. This system is designed and implemented to support network configuration and embedded programming technology of the user on Internet. Not only Static routing protocol but also a kind of dynamic routing protocols such as OSPF and RIP and firewall have been programmed for education based on ethernet interface. ADS 1.2 as debugging environment, uC/OS-ii as RTOS and C language as development language are used. The educational procedures is compile, loading of static routing protocol, a kind of dynamic routing protocols such as OSPF and RIP and firewall program already supplied. Thereafter the verification is checked by using "ping" test to allow for demo operation such as hands-on training procedure. Finally programming procedure similar with demo operation of static routing protocol, a kind of dynamic routing protocols such as OSPF and RIP and packet filtering function is educated step by step.