• Title/Summary/Keyword: IEC 62439-3

Search Result 5, Processing Time 0.022 seconds

IED Redundancy Performance for Full Digital Substation (Full Digital 변전소용 보호 계전기 이중화 통신 기능)

  • Lim, Young-Bin;Kim, Kyung-Ho;Shin, Chul-Ho;Kim, Young-Geun
    • Proceedings of the KIEE Conference
    • /
    • 2015.07a
    • /
    • pp.221-222
    • /
    • 2015
  • 디지털 변전소를 위해 IEC61850 국제 표준 프로토콜을 적용한 보호계전기(IED), 게이트웨이, HMI등이 필드에서 사용되고 있고, 전체 디지털 변전소를 위한 병합장치(Merging Unit: MU)등도 실제 운영되고 있다. 디지털 변전소는 기존 변전소를 효과적으로 운영하기 위해 필요한 높은 수준의 가용성과 전송능력이 필요하다. IEC TC 57 WG10은 디지털 변전소를 위한 이중화 사양으로 IEC SG65C WG15의 IEC62439-3/4 고속 절체 네트워크 운영 프로토콜(Highly Available Seamless Redundancy: HSR),(Parallel Redundancy Protocol: PRP)들을 추천하고 있다. 본 논문에서는 프로세스 버스의 병합장치(MU)로부터 계측된 전류와 전압을 고속 이더넷을 통해 샘플 계측값(Sampled Measured Values: SMV)을 전송받고, 고정밀 IEEE1588v2 PTP(Precision Time Protocol) 시각동기를 하며, 스테이션 레벨에서 MMS와 GOOSE 통신을 하는 계전기와 성능에 대한 것이다.

  • PDF

RLP : An Efficient HSR Traffic Reduction Algorithm

  • Nsaif, Saad Allawi;Jun, Je Hyun;Shin, Sang Heon;Rhee, Jong Myung
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.47-53
    • /
    • 2012
  • In this paper, we present an algorithm called redundant logical paths (RLP) for efficient HSR traffic reduction. It creates redundant logical paths between each HSR node and all the other nodes. Eventually, a logical full-meshed network or paths will be established among all HSR node types, except the Quadbox type, which is used only for interconnection. The logical full-meshed network will be used instead of using the standard HSR protocol that depends on the concepts of the duplication and forwarding of the received frame until it reaches the destination node. The RLP algorithm results in significantly less frame traffic because there is no random forwarding as in the standard HSR protocol. For the sample network in this paper simulation results showed a 61.5-80% reduction in network frame traffic compared to the standard HSR. Our algorithm will avoid latency issues in the network and even network congestion, thus improving network efficiency.

RMT: A Novel Algorithm for Reducing Multicast Traffic in HSR Protocol Networks

  • Nsaif, Saad Allawi;Rhee, Jong Myung
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.123-131
    • /
    • 2016
  • The high-availability seamless redundancy (HSR) protocol is one of the most important redundancy IEC standards that has garnered a great deal of attention because it offers a redundancy with zero recovery time, which is a feature that is required by most of the modern substation, smart grid, and industrial field applications. However, the HSR protocol consumes a lot of network bandwidth compared to the Ethernet standard. This is due to the duplication process for every sent frame in the HSR networks. In this paper, a novel algorithm known as the reducing multicast traffic (RMT) is presented to reduce the unnecessary redundant multicast traffic in HSR networks by limiting the spreading of the multicast traffic to only the rings that have members associated with that traffic instead of spreading the traffic into all the network parts, as occurs in the standard HSR protocol. The mathematical and the simulation analyses show that the RMT algorithm offers a traffic reduction percentage with a range of about 60-87% compared to the standard HSR protocol. Consequently, the RMT algorithm will increase the network performance by freeing more bandwidth so as to reduce HSR network congestion and also to minimize any intervention from the network administrator that would be required when using traditional traffic filtering techniques.

High-availability Seamless Redundancy(HSR) Protocol for Automobile Networks (차세대 차량 네트워크를 위한 HSR (High-availability seamless Redundancy) 프로토콜 적용 연구)

  • Park, Jin-Pyo;Nsaif, Saad Allawi;Rhee, Jong-Myung
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.3
    • /
    • pp.33-40
    • /
    • 2014
  • One of the most important requirements for the Ethernet-based automobile is the reliability. In order to achieve this goal, we propose using the High-availability Seamless Redundancy (HSR) protocol (IEC 62439-3 clause 5) in these networks. The HSR protocol provides duplicated frame copies for each sent frame, which means that the destination node will receive at least one copy in case the second copy is lost due to a failure. In other words, there will be no network stoppage even if failure occurs. Moreover, the destination node will receive at least one frame copy with zero-recovery time (seamless) and it will not need to wait to receive the other copy if the first one is lost, which occurs it in the Ethernet standard, as a result of reconfiguration of the network paths. However, the main drawback of the HSR protocol is the unnecessary redundant traffic that is caused by the duplicated frames. Several solutions, including QR, VRing, RURT, and DVP, have already been proposed to improve the traffic performance of the HSR protocol. In this paper, we propose three automobile network topologies. each of which has pros and cons depending on the automobile requirements. Then we applied the HSR protocol with and without the QR and VRing approaches to each scenario. The comparison among these topologies depend on the traffic performance result for each of them. The QR and VRing approaches give a better traffic reduction percentage, ranging from 48% to 75% compared to the standard HSR protocol. Therefore they could limit the redundant traffic in automobile networks when the HSR protocol is used instead of the Ethernet network, which does not provide any seamless recovery if a failure occurs.

Improvement of High-Availability Seamless Redundancy (HSR) Traffic Performance for Smart Grid Communications

  • Nsaif, Saad Allawi;Rhee, Jong Myung
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.653-661
    • /
    • 2012
  • High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.