Abstract
The reliability of an information network is important, since an information network such as the Internet is an important social infrastructure. Especially, when the failure of a node occurs and the information network is fragmented, services cannot be appropriately offered. In order to avoid such a situation, it is necessary to reduce the probability of network fragmentation by using the backup facility. It costs much to protect a node by backup facility; therefore, it is not practical to protect all nodes, and only critical nodes whose failures significantly degrade the performance of an information network must be protected. Since the number of these nodes must be small as much as possible, it is important to find the smallest number of nodes to be protected so that a network resulting from the failures of any non-protected nodes is not fragmented to many small connected components. In this paper, we address the problem of determining a set of the protected nodes that achieves the maximum probability that the number of nodes in the connected components of the network remaining after the failures of any non-protected nodes under cost constraint exceeds a given threshold. We formulate this problem mathematically, show its NP-hardness, and design a polynomial-time heuristic algorithm. Furthermore, we evaluate the performance of the algorithm by using the topology of actual information networks.
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
Similar content being viewed by others
References
Albert, R., et al.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)
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., Miwa, H.: Approximation algorithm for finding protected links to keep small diameter against link failures. In: Proceedings of INCoS 2011, Fukuoka, Japan, pp. 575-580, 30 November–2 December 2011 (2011)
Imagawa, K., Miwa, H.: Detecting protected links to keep reachability to server against failures. In: Proceedings of ICOIN 2013, Bangkok, 28–30 January 2013 (2013)
Irie, D., Kurimoto, S., Miwa, H.: Detecting critical protected links to keep connectivity to servers against link failures. In: Proceedings of NTMS 2015, Paris, 27–29 July 2015, pp. 1–5 (2015)
Maeda, N., Miwa, H.: Detecting critical links for keeping shortest distance from clients to servers during failures. In: Proceedings of HEUNET 2012/SAINT 2012, Turkey, 16–20 July 2012 (2012)
Fujimura, T., Miwa, H.: Critical links detection to maintain small diameter against link failures. In: Proceedings of INCoS 2010, Thessaloniki, 24–26 November 2011, pp. 339–343 (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 INCoS 2016, Ostrava, 7–9 September 2016, pp. 339–343 (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 INCoS 2016, Ostrava, 7–9 September 2016, pp. 439–344 (2016)
Matsui, T., Miwa, H.: Method for finding protected nodes for robust network against node failures. In: Proceedings of INCoS 2014, Salerno, Italy, 10–12 September 2014, pp. 378–383 (2014)
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: Barolli, L., Woungang, I., Hussain, O.K. (eds.) INCoS 2017. LNDECT, vol. 8, pp. 413–422. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-65636-6_37
Morino, Y., Miwa, H.: Network design method considering cost to decrease failure probability. In: Advances in Intelligent Networking and Collaborative Systems, pp. 493–502 (2020)
Yehuda, R.B., Even, S.: Local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25, 27–46 (1985)
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).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Yano, H., Yoneyama, S., Miwa, H. (2022). Reliable Network Design Problem by Improving Node Reliability. In: Barolli, L., Kulla, E., Ikeda, M. (eds) Advances in Internet, Data & Web Technologies. EIDWT 2022. Lecture Notes on Data Engineering and Communications Technologies, vol 118. Springer, Cham. https://doi.org/10.1007/978-3-030-95903-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-95903-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95902-9
Online ISBN: 978-3-030-95903-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)