Browse > Article
http://dx.doi.org/10.6109/jkiice.2012.16.4.701

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

Tak, Sung-Woo (부산대학교 정보컴퓨터공학부)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.16, no.4, 2012 , pp. 701-712 More about this Journal
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.
Keywords
$k$-Shortest disjoint paths; Ship backbone network; IEC61162-410 standard; Network restoration;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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.   DOI   ScienceOn
2 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.
3 R. Bhandari, "Optimal diverse routing in telecommunication fiber networks," Proc. IEEE International and Conference on Computer Communications, pp. 1498-1508, 1994.
4 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.
5 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.   DOI   ScienceOn
6 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.   DOI   ScienceOn
7 B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," Proc. IEEE International and Conference on Computer Communications, pp. 519-528, 2000.
8 A. Basu and J.G. Riecke, "Stability issues in OSPF routing," Proc. ACM Conference on Applications, Technologies, Architectures, and Protocols, pp. 225-236, 2001.
9 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.
10 I.H. Osman and G. Laporte, "Metaheuristic: A bibliography," Anneals of Operations Research, vol. 63, pp. 513-538, 1996.
11 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.
12 IEC61162-410, "Multiple talkers and multiple listeners - ship system interconnection - transport profile requirements and basic transport profile," 2001.
13 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.
14 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.
15 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.
16 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.   DOI   ScienceOn