Skip to main content
SpringerLink
Log in

Optimization Problem for Network Design by Link Protection and Link Augmentation

  • Conference paper
  • First Online:
Advances in Internet, Data and Web Technologies (EIDWT 2020)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 47))

  • 894 Accesses

Abstract

Information networks need high reliability. Although link failure is one of the causes of communication disconnection in networks, it is necessary to be able to continue communication even in such a failure. There are two approaches of link protection and link addition against link failure. Link protection is to make the failure probability of links sufficiently small by sufficient backup resource and rapid recovery system. Link addition is to increase network connectivity by adding new links to a network. Both link addition and link protection are methods to design a reliable network. Some network design methods either only by link addition or only by link protection have been investigated so far. However, it is possible to design a reliable network at lower cost by a combination of link addition and protection than a network designed either by only link addition or by only link protection. In this paper, we deal with a network design problem to realize a reliable network at lower cost by combining link addition and link protection. First, we formulate this network design problem as a decision problem and we prove the NP-hardness. Furthermore, we propose some polynomial-time algorithms for the problems of the optimization version under some restricted conditions.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Frank, A.: Augmenting graphs to meet edge-connectivity requirements. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, St. Louis, 22–24 October 1990

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Kortsarz, G., Krauthgamer, R., Lee, J.R.: Hardness of approximation for vertex-connectivity network design problems. In: Jansen, K., Leonardi, S., Vazirani, V. (eds.) Approximation Algorithms for Combinatorial Optimization. Lecture Notes in Computer Science, vol. 2462, pp. 185–199. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graph. Comput. Oper. Res. 36(7), 2193–2200 (2009)

    Article  MathSciNet  Google Scholar 

  5. Imagawa, K., Miwa, H.: Detecting protected links to keep reachability to server against failures. In: Proceedings of ICOIN 2013, Bangkok, 28–30 January 2013

    Google Scholar 

  6. Noguchi, A., Fujimura, T., Miwa, H.: Network design method by link protection for network load alleviation against failures. In: Proceedings of International Conference on Intelligent Networking and Collaborative Systems (INCoS 2011), Fukuoka, Japan, 30 November–2 December 2011, pp. 581–586 (2011)

    Google Scholar 

  7. Fujimura, T., Miwa, H.: Critical links detection to maintain small diameter against link failure. In: Proceedings of INCoS 2010, Thessaloniki, Greece, 24–26 November 2010, pp. 339–343 (2010)

    Google Scholar 

  8. Imagawa, K., Miwa, H.: Approximation algorithms for finding protected links to keep small diameter during link failures. In: IEICE Technical Report, Miyazaki, Japan, 8–9 March 2012, vol. 111, no. 468, pp. 403–408 (2012)

    Google Scholar 

  9. Morino, Y., Miwa, H.: Network design method resistant to cascade failure considering betweenness centrality. In: Proceedings INCoS 2019, Oita, 5–7 September 2019, pp. 360–369 (2019)

    Google Scholar 

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

Author information

Authors and Affiliations

  1. School of Science and Technology, Kwansei Gakuin University, 2-1 Gakuen, Sanda-shi, Hyogo, 669-1337, Japan

    Hiroki Yano & Hiroyoshi Miwa

Authors
  1. Hiroki Yano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroyoshi Miwa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hiroyoshi Miwa .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. Innovation Center for Educational Resources, University Library, Kyushu University, Fukuoka, Japan

    Yoshihiro Okada

  3. Department of Electrical Engineering and Information Technology, University of Naples "Frederico II", Naples, Italy

    Flora Amato

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

Yano, H., Miwa, H. (2020). Optimization Problem for Network Design by Link Protection and Link Augmentation. In: Barolli, L., Okada, Y., Amato, F. (eds) Advances in Internet, Data and Web Technologies. EIDWT 2020. Lecture Notes on Data Engineering and Communications Technologies, vol 47. Springer, Cham. https://doi.org/10.1007/978-3-030-39746-3_52

Download citation

Publish with us

Policies and ethics

Search

Navigation