Abstract
It is important to design robust networks that are resistant to network failures, because high reliability is required for communication networks as important infrastructure. For that purpose, there is an approach of link protection to decrease link failure probability by the backup mechanism and the fast recovery mechanism; however, enormous cost is required, if the failure probability of all links must be decreased. It is realistic to preferentially protect only some highly required links so that the reliability of the entire network is improved. In this paper, we assume that the failure probability of each link can be reduced according to cost for protection. Since the failure probability of each link is decreased by the cost allocated to the link, the network reliability defined as the probability that the entire network is connected, is increased. We define the network design problem that determines the cost allocated for each link, under the constraint that the sum of the cost allocated for each link must be less than or equal to a given threshold, so that the network reliability is maximized. We show the NP-hardness of this optimization problem and design a polynomial-time heuristic algorithm. Moreover, we evaluate the performance by using the topology of some actual communication networks, and we show that the proposed algorithm works well.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Frank, A.: Augmenting graphs to meet edge-connectivity requirements. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, St. Louis, 22–24 October 1990
Ishii, T., Hagiwara, M.: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discrete Appl. Math. 154(16), 2307–2329 (2006)
Kortsarz, G., Krauthgamer, R., Lee, J.R.: Hardness of Approximation for Vertex-Connectivity Network Design Problems, vol. 2462, pp. 185–199. Springer, Heidelberg (2002)
Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graph. Proc. Comput. Oper. Res. 36(7), 2193–2200 (2009)
Imagawa, K., Fujimura, T., Miwa, H.: Approximation algorithms for finding protected links to keep small diameter against link failures. In: Proceedings of INCoS2011, Fukuoka, Japan, 30 November 2011–December 1–2 2011
Imagawa, K., Miwa, H.: Detecting protected links to keep reachability to server against failures. In: Proceedings of ICOIN2013, Bangkok, 28–30 January 2013
Imagawa, K., Miwa, H.: Approximation algorithm for finding protected links to keep small diameter against link failures. In: Proceedings of INCoS2011, Fukuoka, Japan, pp. 575–580, 30 November 2011–2 December 2011
Maeda, N., Miwa, H.: Detecting critical links for keeping shortest distance from clients to servers during failures. In: Proceedings of HEUNET2012/SAINT2012, Turkey, 16–20 July 2012
Irie, D., Kurimoto, S., Miwa, H.: Detecting critical protected links to keep connectivity to servers against link failures. In: Proceedings of NTMS 2015, Paris, pp. 1–5, 27–29 July 2015
Fujimura, T., Miwa, H.: Critical links detection to maintain small diameter against link failures. In: Proceedings of INCoS2010, Thessaloniki, pp. 339–343, 16–24 November 2011
Yamasaki, T., Anan, M., Miwa, H.: Network design method based on link protection taking account of the connectivity and distance between sites. In: Proceedings of INCoS2016, Ostrava, pp. 339–343, 7–9 September 2016
Irie, D., Anan, M., Miwa, H.: Network design method by finding server placement and protected links to keep connectivity to servers against link failures. In: Proceedings of INCoS2016, Ostrava, pp. 439-344, 7–9 September 2016
Aggarwal, K.K., Chopra, Y.C., Bajwa, J.S.: Topological layout of links for optimising the overall reliability in a computer communication system. Microelectron. Reliab. 22, 347–351 (1982)
Jan, R.-H., Hwang, F.-J., Chen, S.-T.: Topological optimization of a communication network subject to a reliability constraint. IEEE Trans. Reliab. 42, 63–70 (1993)
Koide, T., Shinmori, S., Ishii, H.: The evaluations on lower bounds of all-terminal reliability by arc-packings for general networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E82A(5), 784–791 (1990)
Uji, K., Miwa, H.: Method for finding protected links to keep robust network against link failure considering failure probability. In: Proceedings of International Conference on Intelligent Networking and Collaborative System (INCoS2017), Toronto, Canada, 24–26 August 2017
CAIDA. http://www.caida.org/
Acknowledgements
This work was partially supported by the Japan Society for the Promotion of Science through Grants-in-Aid for Scientific Research (B) (17H01742) and JST CREST JPMJCR1402.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Uji, K., Miwa, H. (2019). Reliable Network Design Problem Considering Cost to Improve Link Reliability. In: Xhafa, F., Barolli, L., Greguš, M. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2018. Lecture Notes on Data Engineering and Communications Technologies, vol 23. Springer, Cham. https://doi.org/10.1007/978-3-319-98557-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-98557-2_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98556-5
Online ISBN: 978-3-319-98557-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)