• Title/Summary/Keyword: $k$-최단 분리 경로 배정

Search Result 1, Processing Time 0.014 seconds

Performance Evaluation of a Survivable Ship Backbone Network Exploiting k-Shortest Disjoint Paths (k-최단 분리 경로 배정을 적용한 장애 복구형 선박 백본 네트워크의 성능 평가)

  • Tak, Sung-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.4
    • /
    • pp.701-712
    • /
    • 2012
  • The concept of $k$-shortest disjoint paths is considered important because the establishment of primary and backup forwarding paths exploiting shorter distance and faster propagation time is a dominant consideration for the design of a survivable backbone network. Therefore, we need to evaluate how well the concept of $k$-shortest disjoint paths is exploited for the design of a survivable ship backbone network considering the international standard related to ship backbone networks, the IEC61162-410 standard specifying how to manage redundant message transmissions among ship devices. Performance evaluations are conducted in terms of following objective goals: link capacity, hop and distance of primary and backup paths, even distribution of traffic flows, restoration time of backup forwarding paths, and physical network topology connectivity.