Abstract
Information network must be sufficiently reliable. The most reliable method is to protect all links so that the failure probability of a link is sufficiently small by sufficient backup resource and rapid recovery system. However, as link protection needs much cost, it is necessary to find the smallest number of links to be protected so that a network resulting from failures of any non-protected links can provide sufficient connectivity. Especially, in content delivery services, a request from a user is navigated to one of the mirror servers so that small delay time and balance of loads can be achieved; the network topology must be designed so that the navigation can be efficiently achieved even after failure. In this paper, we focus on the problem of finding the protected links so that the conditions that include the stretch factor and the fragmentation factor are satisfied. First, we formulate this problem and prove that this problem is NP-hard. Next, we present a polynomial-time algorithm to solve the problem that the number of the simultaneous link failures is restricted to one. Furthermore, we present a polynomial-time approximation algorithm with the approximation ratio of a constant that is the number of the simultaneous link failures. In addition, we apply the approximation algorithms to the topology of actual networks and evaluate the approximation ratio.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
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)
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)
Imagawa, K., Miwa, H.: Detecting protected links to keep reachability to server against failures. In: Proceedings of ICOIN 2013, Bangkok, 28–30 January 2013
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)
CAIDA. http://www.caida.org/
Acknowledgment
This work was partially supported by 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
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Irie, D., Miwa, H. (2018). Network Design Method by Link Protection to Keep Connectivity and Communication Quality to Servers. In: Barolli, L., Woungang, I., Hussain, O. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-65636-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-65636-6_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65635-9
Online ISBN: 978-3-319-65636-6
eBook Packages: EngineeringEngineering (R0)