Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Performance Evaluation of a Survivable Ship Backbone Network Exploiting k-Shortest Disjoint Paths

k-최단 분리 경로 배정을 적용한 장애 복구형 선박 백본 네트워크의 성능 평가

  • 탁성우 (부산대학교 정보컴퓨터공학부)
  • Received : 2012.01.13
  • Accepted : 2012.02.26
  • Published : 2012.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

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.

장애 복구형 백본 네트워크에서 경로의 짧은 거리 및 빠른 전파 지연시간은 주 경로와 백업 경로의 설정시 활용될 수 있는 중요한 성능 인자이기에 이에 $k$-최단 분리 경로 개념은 이러한 백본 네트워크 환경에서 매우 중요하게 고려된다. 이에 본 논문에서는 선박 장비 간의 중복 메시지 전송 기능을 명세하는 IEC61162-410 표준이 적용된 장애 복구형 선박 백본 네트워크에서 $k$-최단 분리 경로 개념의 적합성을 비교 평가하였다. 성능 평가는 링크 용량, 주경로 및 백업 경로의 홉 및 거리, 트래픽 흐름의 균등 분포, 백업 경로의 장애 복구 시간, 그리고 물리 네트워크 토폴로지의 연결성 측면에서 수행되었다.

Keywords

References

  1. IEC61162-410, "Multiple talkers and multiple listeners - ship system interconnection - transport profile requirements and basic transport profile," 2001.
  2. C. Assi, Y. Ye, A. Shami, S. Dixit, and M. Ali, "Efficient path selection and fast restoration algorithms for shared restorable optical networks," Proc. IEEE International Conference on Communications, pp. 1412-1416, 2003.
  3. A. Dacomo, S. Patre, G. Maier, A. Pattavina, and M. Martinelli, "Design of static resilient WDM mesh networks with multiple heuristic criteria," Proc. IEEE International and Conference on Computer Communications, pp. 1793-1802, 2002.
  4. H. Luo and L. Ruan, "Load balancing heuristics for dynamic establishment of restorable lightpaths," Proc. International Conference on Computer Communications and Networks, pp. 472-477, 2002.
  5. T. Narula, "Survivable lightpath routing: A new approach to the design of WDM-based networks," IEEE JSAC vol. 20, no. 4, pp. 800-809, 2002.
  6. PH. Ho and H. Mouftah, "A framework for service-guaranteed shared protection in WDM mesh networks," IEEE Communications Magazine, vol. 40, no. 2, pp. 97-103, 2002. https://doi.org/10.1109/35.983914
  7. S. Sengupta and R. Ramamurthy, "From network design to dynamic provisioning and restoration in optical cross-connect mesh networks: an architectural and algorithmic Overview," IEEE Network, vol. 15, no. 4, pp. 46-54, 2001. https://doi.org/10.1109/65.941836
  8. D. Dunn, W. Grover, and M. Gregor, "Comparison of k-shortest paths and maximum flow routing for network facility restoration," IEEE JSAC, vol. 12, no. 1, pp. 88-89, 1994.
  9. R. Bhandari, "Optimal diverse routing in telecommunication fiber networks," Proc. IEEE International and Conference on Computer Communications, pp. 1498-1508, 1994.
  10. M. Saad and Z. Luo, "Design of WDM networks under economy of scale pricing and shortest path routing," IEEE JSAC, vol. 24, no. 4, pp. 26-36, 2006.
  11. H. Chen and P. Tseng, "Low complexity shortest path tree restoration scheme for IP networks," IEEE Communications Letters, vol. 14, no. 6, pp. 566-568, 2010. https://doi.org/10.1109/LCOMM.2010.06.092480
  12. B. Fortz, J. Rexford, and M. Thorup, "Traffic engineering with traditional IP routing networks," IEEE Communications Magazine, vol. 40, no. 10, pp. 118-124, 2002. https://doi.org/10.1109/MCOM.2002.1039866
  13. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," Proc. IEEE International and Conference on Computer Communications, pp. 519-528, 2000.
  14. A. Basu and J.G. Riecke, "Stability issues in OSPF routing," Proc. ACM Conference on Applications, Technologies, Architectures, and Protocols, pp. 225-236, 2001.
  15. S. Samieian, Z. Bogdanowicz, R. Ramamurthy, S. Chaudhuri, and K. Bala, "Capacity requirements of ring, 1+1 and mesh configurations," Lightwave Magazine, pp. 114-132, August 2001.
  16. I.H. Osman and G. Laporte, "Metaheuristic: A bibliography," Anneals of Operations Research, vol. 63, pp. 513-538, 1996.