Abstract
In the modern network with high data transmission rate, coping with the link failures rapidly becomes a major network fault-tolerant challenge. Existing techniques adopt a survivable spanning connection (SSC) including two not-fully-disjoint spanning trees to prevent link failures. However, the spanning trees in SSC will be invalid when the shared links fail. This paper aims to algorithmic technique for fast restoring the invalid spanning trees in SSC. Firstly, we model an optimization problem of restoring the SSC based on the existing invalid spanning trees. Then restoration algorithm is proposed for the faulty shared link by two spanning trees. In the proposed algorithm, the edges linking the two subtrees of one tree with the fault are collected to form a set of the candidate links. Then, the link with the minimum failure probability is selected from the candidate set, and it is added into the spanning trees for generating a new SSC. Experimental results show that the recovery time is reduced up to 36% in comparison to the latest work cited in this paper, for the network with sizes varying from 10 to 100. Meanwhile, the loss rate of survivability is kept no more than 1%.
Keywords
Supported in part by project of Guangdong Science and Technology Plan under Grant 2019B010118001, and the National Natural Science Foundation of China under Grant 61871475.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Christopher, R.C.: 100-Gb/s and beyond transceiver technologies. Opt. Fiber Technol. 17(5), 472–479 (2011)
Zhou, Z., Lin, T.: Survivable Probability of SDN-enabled Cloud Networking with Random Physical Link Failure. Computer Science: Networking and Internet Architecture (2017)
Wang, R., Gao, S., Yang, W., Jiang, Z.: Energy aware routing with link disjoint backup paths. Comput. Netw. Int. J. Comput. Telecommun. Netw. 115, 42–53 (2017)
Yallouz, J., Rottenstreich, O., Orda, A.: Tunable survivable spanning trees. IEEE/ACM Trans. Netw. 24(3), 1853–1866 (2016)
Moussaoui, A., Boukeream, A.: A survey of routing protocols based on link stability in mobile ad hoc networks. J. Netw. Comput. Appl. 47, 1–10 (2015)
ITU-T G.8032: Ethernet Ring Protection Switching (2015)
Roskind, J., Tarjan, R.E.: A note on finding minimum-cost edge-disjoint spanning trees. Math. Oper. Res. 10(4), 701–708 (1985)
Clausen, J., Hansen, L.A.: Finding k edge-disjoint spanning trees of minimum total weight in a network: an application of matroid theory. In: Rayward-Smit, V.J. (ed.) Combinatorial Optimization II. Mathematical Programming Studies, vol. 13, pp. 88–101. Springer, Heidelberg (1980). https://doi.org/10.1007/BFb0120910
AlBdaiwi, B., Hussain, Z., Cerny, A., Aldred, R.: Edge-disjoint node-independent spanning trees in dense gaussian networks. J. Supercomput. 72(12), 4718–4736 (2016). https://doi.org/10.1007/s11227-016-1768-x
Yallouz, J., Orda, A.: Tunable QoS-aware network survivability. IEEE/ACM Trans. Netw. 25(1), 139–149 (2017)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. Comput. Netw. 29(4), 251–262 (1999)
Waxman, B.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zheng, L., Wu, Y., Huang, J., Liu, P., Wu, J. (2021). Restoring Survivable Spanning Tree: An Alternative Algorithm. In: Ning, L., Chau, V., Lau, F. (eds) Parallel Architectures, Algorithms and Programming. PAAP 2020. Communications in Computer and Information Science, vol 1362. Springer, Singapore. https://doi.org/10.1007/978-981-16-0010-4_1
Download citation
DOI: https://doi.org/10.1007/978-981-16-0010-4_1
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-0009-8
Online ISBN: 978-981-16-0010-4
eBook Packages: Computer ScienceComputer Science (R0)