Abstract
It is important to design a reliable information network that is resistant to network failures. Protection to decrease failure probability by both backup mechanism and fast recovery mechanism is an approach to design such an information network. However, enormous cost is required, if the failure probability of all network elements must be decreased. Therefore, it is practical to preferentially protect only some highly required network elements so that the reliability of the entire information network is improved. In this paper, we assume that the failure probability of a failure set, a set of network elements that simultaneously fails at a single disaster, can be decreased according to cost for protection. Since failure probability of each failure set is decreased according to cost assigned to the failure set, the network failure probability defined as the probability that the entire information network is not connected, is decreased. We define a network design problem that determines cost assigned to each failure set so that the sum of the cost assigned to each failure set is minimized under the constraint that the network failure probability must be within a threshold. First, we formulate the network design problem as a 0–1 integer programming problem, when the relationship between cost and probability decreased according to cost is a step function. In addition, we evaluate the performance by using the topology of some actual information networks.
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 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. Lect. Notes Comput. Sci. 2462, 185–199 (2002)
Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graph. In: Proceedings Computers & Operations Research, vol. 36(7), pp. 2193–2200, July 2009
Aggarwal, K.K., Chopra, Y.C., Bajwa, J.S.: Topological layout of links for optimising the overall reliability in a computer communication system. Microelectron. Reliabil. 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. Reliabil. 42, 63–70 (1993)
Uji, K., Miwa, H.: “Reliable network design problem considering cost to improve link reliability.” In: Proceedings International Conference on Intelligent Networking and Collaborative System (INCoS2018), Bratislava, Slovakia, 5–7 September 2018
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
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Morino, Y., Miwa, H. (2021). Reliable Network Design Considering Cost to Decrease Failure Probability of Simultaneous Failure. In: Barolli, L., Li, K., Miwa, H. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2020. Advances in Intelligent Systems and Computing, vol 1263. Springer, Cham. https://doi.org/10.1007/978-3-030-57796-4_47
Download citation
DOI: https://doi.org/10.1007/978-3-030-57796-4_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-57795-7
Online ISBN: 978-3-030-57796-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)