Skip to main content
SpringerLink
Log in

Restoring Survivable Spanning Tree: An Alternative Algorithm

  • Conference paper
  • First Online:
Parallel Architectures, Algorithms and Programming (PAAP 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1362))

  • 725 Accesses

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%.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Christopher, R.C.: 100-Gb/s and beyond transceiver technologies. Opt. Fiber Technol. 17(5), 472–479 (2011)

    Article  Google Scholar 

  2. Zhou, Z., Lin, T.: Survivable Probability of SDN-enabled Cloud Networking with Random Physical Link Failure. Computer Science: Networking and Internet Architecture (2017)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Yallouz, J., Rottenstreich, O., Orda, A.: Tunable survivable spanning trees. IEEE/ACM Trans. Netw. 24(3), 1853–1866 (2016)

    Article  Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. ITU-T G.8032: Ethernet Ring Protection Switching (2015)

    Google Scholar 

  7. Roskind, J., Tarjan, R.E.: A note on finding minimum-cost edge-disjoint spanning trees. Math. Oper. Res. 10(4), 701–708 (1985)

    Article  MathSciNet  Google Scholar 

  8. 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

    Chapter  Google Scholar 

  9. 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

    Article  Google Scholar 

  10. Yallouz, J., Orda, A.: Tunable QoS-aware network survivability. IEEE/ACM Trans. Netw. 25(1), 139–149 (2017)

    Article  Google Scholar 

  11. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)

    Google Scholar 

  12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. Comput. Netw. 29(4), 251–262 (1999)

    MATH  Google Scholar 

  13. Waxman, B.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computers, Guangdong University of Technology, Guangzhou, China

    Lulu Zheng, Yalan Wu, Jiale Huang, Peng Liu & Jigang Wu

Authors
  1. Lulu Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yalan Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiale Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jigang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jigang Wu .

Editor information

Editors and Affiliations

  1. Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China

    Li Ning

  2. Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China

    Vincent Chau

  3. The University of Hong Kong, Hong Kong, China

    Francis Lau

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation