Abstract
It is an important issue to design a highly reliable information network that is robust against network failures. As a method for design of a robust network, there is an approach of protection, which decreases link failure probability by backup mechanism and fast recovery mechanism. It is desirable to protect all links; however, link protection needs much cost. Therefore, it is necessary to find the small number of links to be protected so that a network resulting from failure of any non-protected links satisfies constraints of quality. In this paper, we propose a method to design an information network satisfying multiple constraints by using an efficient data structure, Zero-suppressed Binary Decision Diagram (ZDD). This method holds the set of the feasible solutions satisfying each constraint by ZDD, and it determines the intersection of the sets of the feasible solutions for all constraints by the calculation of ZDD. Thus, the method can determine the sets of the feasible solutions satisfying the multiple constraints simultaneously, and finally it determines the optimum solution. This approach also makes it easy to change or to add constraints.
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
Imagawa, K., Fujimura, T., Miwa, H.: Method for finding protected links to keep small diameter against failures. Int. J. Space-Based Situated Comput. 3(2), 83–90 (2013)
Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problem. In: 30th ACM/IEEE Design Automation Conference, pp. 272–277 (1993)
Imagawa, K., Miwa, H.: Detecting protected links to keep reachability to server against failures. In: Proceedings of the ICOIN 2013, Bangkok, 28–30 January 2013
Morino, Y., Miwa, H.: Network design method resistant to cascade failure considering betweenness centrality. In: Proceedings of the International Conference on Intelligent Networking and Collaborative System (INCoS 2019), Oita, Japan, 5–7 September 2019
Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. C–27(6), 509–516 (1978)
Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Frontier-based search for enumerating all constrained subgraphs with compressed representation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100(9), 1773–1784 (2017)
Toda, T.: Hypergraph transversal computation with binary decision diagrams. In: International Symposium on Experimental Algorithms, pp. 91–102. Springer, Heidelberg (2013)
Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Graphillion: software library for very large sets of labeled graphs. Int. J. Softw. Tools Technol. Transf. 18(1), 57–66 (2016)
Monien, B., Speckenmeyer, E.: Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica 22, 115–123 (1985)
CAIDA. http://www.caida.org/
Acknowledgement
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
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Akasaka, M., Miwa, H. (2020). Efficient Method for Link Protection Under Multiple Constraints Using ZDD. In: Barolli, L., Amato, F., Moscato, F., Enokido, T., Takizawa, M. (eds) Web, Artificial Intelligence and Network Applications. WAINA 2020. Advances in Intelligent Systems and Computing, vol 1150. Springer, Cham. https://doi.org/10.1007/978-3-030-44038-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-44038-1_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44037-4
Online ISBN: 978-3-030-44038-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)