Abstract
Previous approaches for assessing network availability in a shared-backup path protected network are not guaranteed to provide best-case or optimum availability. By incorporating linear programming directly within the availability analysis approach, the algorithm presented herein seeks to provide the maximum network availability achievable, given a specified network capacity plan. We also investigate the relationship between the amount of spare capacity provided to the network and the resultant maximized availability. The algorithmic approach is tested on a suite of test case networks of varying scale and connectivity.
© 2018 Optical Society of America
Full Article | PDF ArticleMore Like This
Gangxiang Shen, Yue Wei, and Sanjay K. Bose
J. Opt. Commun. Netw. 6(7) 649-659 (2014)
Hong Guo, Hua Dai, Chao Wang, Yongcheng Li, Sanjay K. Bose, and Gangxiang Shen
Opt. Express 23(15) 20158-20175 (2015)
Venkatesh Chebolu, Sadananda Behera, and Goutam Das
J. Opt. Commun. Netw. 14(8) 640-653 (2022)