Skip to main content

Network Design Method by Link Protection Considering Probability of Simultaneously Links Failure

  • Conference paper
  • First Online:
Advances in Intelligent Networking and Collaborative Systems (INCoS 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1035))

  • 853 Accesses

Abstract

Information networks are required to be reliable. It is important to design robust networks that are resistant to network failure. For that propose, it is necessary to decrease the failure probability of links by the backup resource and the fast recovery mechanism and so on. However, it costs very much to protect all the links. Therefore, it is necessary to preferentially protect only some highly required links and improve the reliability of the entire network. In this paper, we consider the simultaneously failure of links. A set of links has the probability that all the links in the set simultaneously are broken. When a family of the sets is given, we address the network design maximizing the network reliability (the probability that the entire network is connected) by protecting the limited number of links. We formulate this network design problem and propose a polynomial-time heuristic algorithm. Furthermore, we evaluate the performance by using the topology of some actual information networks, and we show that the proposed algorithm works well.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.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. Imagawa, K., Fujimura, T., Miwa, H.: Approximation algorithms for finding protected links to keep small diameter against link failures. In: Proceedings of the INCoS2011, Fukuoka, Japan, 30 November–1–2 December 2011 (2011)

    Google Scholar 

  2. 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 (2013)

    Google Scholar 

  3. Imagawa, K., Miwa, H.: Approximation algorithm for finding protected links to keep small diameter against link failures. In: Proceedings of the INCoS 2011, Fukuoka, Japan, 30 November 2011–2 December 2011, pp. 575–580 (2011)

    Google Scholar 

  4. Maeda, N., Miwa, H.: Detecting critical links for keeping shortest distance from clients to servers during failures. In: Proceedings of the HEUNET 2012/SAINT 2012, Turkey, 16–20 July 2012 (2012)

    Google Scholar 

  5. Irie, D., Kurimoto, S., Miwa, H.: Detecting critical protected links to keep connectivity to servers against link failures. In: Proceedings of the NTMS 2015, Paris, pp. 1–5, 27–29 July 2015 (2015)

    Google Scholar 

  6. Fujimura, T., Miwa, H.: Critical links detection to maintain small diameter against link failures. In: Proceedings of the INCoS 2010, Thessaloniki, pp. 339–343, 24–16 November 2011 (2011)

    Google Scholar 

  7. 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 the INCoS 2016, Ostrava, pp. 339–343, 7–9 September 2016

    Google Scholar 

  8. 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 the INCoS 2016, Ostrava, pp. 439–344, 7–9 September 2016 (2016)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  11. Uji, K., Miwa, H.: Method for finding protected links to keep robust network against link failure considering failure probability. In: Proceedings of the International Conference on Intelligent Networking and Collaborative System (INCoS 2017), Toronto, Canada, 24–26 August 2017 (2017)

    Google Scholar 

  12. CAIDA. http://www.caida.org/

Download references

Acknowledgements

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

Authors

Corresponding author

Correspondence to Hiroyoshi Miwa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Uji, K., Miwa, H. (2020). Network Design Method by Link Protection Considering Probability of Simultaneously Links Failure. In: Barolli, L., Nishino, H., Miwa, H. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2019. Advances in Intelligent Systems and Computing, vol 1035. Springer, Cham. https://doi.org/10.1007/978-3-030-29035-1_11

Download citation

Publish with us

Policies and ethics