Earticle

초록

영어

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.

목차

ABSTRACT
 I. Introduction
 II. RLP Algorithm
  A. RLP Algorithm
  B. RLP Frame Format
  C. RLP Implementation Process
  D. Path Re-Establishment
 Ⅲ. Traffic Performance
  A. Healthy Case
  B. Faulty Cases
 Ⅳ. Conclusions
 References

키워드

저자

• Saad Allawi NSAIF [ 명지대학교 정보통신공학과 Ubiquitous&Convergence 연구실 ]
• Je Hyun JUN [ 삼성탈레스 C4I 연구소 ]
• Je Hyun JUN [ 삼성탈레스 C4I 연구소 ]
• Jong Myung RHEE [ 이종명 | 명지대학교 정보통신공학과 ] 교신저자

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  한국위성정보통신학회논문지 [Journal of Satellite, Information and Communications]

• 간기

  계간

• pISSN

  2384-3853

• 수록기간

  2006~2017

• 십진분류

  KDC 567 DDC 629