A performance comparision study of k-shortest disjoint forwarding paths in ship backbone networks

Author

Tak, Sungwoo ; Kim, Hyejin ; Kim, Taehoon ; Kim, Heekyum

Author_Institution

Sch. of Comput. Sci. & Eng., Pusan Nat. Univ., Busan, South Korea

fYear

2012

fDate

1-3 Feb. 2012

Firstpage

308

Lastpage

311

Abstract

This paper presents how well the concept of k-shortest disjoint paths is exploited for the design of a survivable ship backbone network considering the IEC61162-410, international standard related to ship backbone networks. A case study based on simulation experiments is conducted to illustrate the application and efficiency of k-shortest disjoint paths in terms of following objective goals: minimal link capacity, minimal forwarding path distance, even distribution of traffic flows, and physical topology connectivity.

Keywords

IEC standards; graph theory; shipbuilding industry; telecommunication network reliability; telecommunication network topology; telecommunication traffic; IEC61162-410; k-shortest disjoint forwarding paths; minimal forwarding path distance; minimal link capacity; performance comparision; physical topology connectivity; survivable ship backbone network design; traffic flow distribution; Algorithm design and analysis; Annealing; Dynamic programming; Heuristic algorithms; Marine vehicles; Network topology; Topology; IEC61162–410; Restoration; Ship Backbone Networks; Survivability; k-Shortest Disjoint Paths;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Networking (ICOIN), 2012 International Conference on

Conference_Location

Bali

ISSN

1976-7684

Print_ISBN

978-1-4673-0251-7

Type

conf

DOI

10.1109/ICOIN.2012.6164408

Filename

6164408