Skip to main content

Method for Determining Recovery Order Against Intermittent Link Failures

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

Abstract

High reliability is required in networks, and it needs to build robust networks. In content delivery services in particular, service interruptions due to disconnection of communication paths between a server and nodes that receive the service must be avoided. Contents delivery services use a master server that contains original contents and edge-servers that hold copies of the contents. It needs that communication paths exist between the master server and the edge-servers even in the network failure. From this background, there is a lot of research on network design method to keep high reliability. On the other hand, recovery scheduling has not considered intermittent link failures, so that, if link failures occur, it was assumed that the failed links are recovered immediately. However, indeed, there is a possibility that network failures occur by an aftershock. In fact, in the Great East Japan Earthquake in 2011 and Kumamoto earthquake in 2016, road networks and electric networks were damaged by not only the main shock but also the aftershocks. In such a case, material resource and human resource are restricted, so that it is necessary to determine the recovery order of the failed links. In this paper, we aim to determine an appropriate recovery order of failed links against intermittent link failures. We formulate the optimization problem determining the recovery order and design a heuristic algorithm. In addition, we evaluate the performance of the algorithm by applying it to the topology of various actual networks.

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 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. 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 International Conference on Intelligent Networking and Collaborative System (INCoS2016), Ostrava, Czech Republic, 7–9 September 2016, pp. 445–450 (2016)

    Google Scholar 

  2. Imagawa, K., Miwa, H.: Approximation algorithm for finding protected links to keep small diameter against link failures. In: Proceedings of International Conference on Intelligent Networking and Collaborative System (INCoS2011), 30 November–2 December 2011, pp. 575–580 (2011)

    Google Scholar 

  3. Sen, C., Yun-jun, L., Ying-wu, C., Yong-ping, S.: Optimized road network emergency restoration scheduling for relief distribution. In: Proceedings of International Conference on E-Business and E-Government (ICEE), 6–8 May 2011, pp. 1–4 (2011)

    Google Scholar 

  4. Itabashi, R., Katsuya, S., Takahiko, K., Yasuo, A.: A location-routing decision model for first-aid restoration of a damaged road network. J. East. Asia Soc. Transp. Stud. 11(25), 557–565 (2015)

    Google Scholar 

  5. Furuta, H., Ishibashi, K., Shun, H.: Optimal restoration scheduling of damaged network under uncertain environment by using improved genetic algorithm. Tsinghua Sci. Technol. 13(2), 400–405 (2008)

    Google Scholar 

  6. Lertworawanich, P.: Highway network restoration after the great flood in Thailands. Nat. Hazards 64, 873–886 (2012)

    Article  Google Scholar 

  7. Zamanifar, M.: Recovery planning model for roadways network after natural hazard. Nat. Hazards, 1–18 (2017)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman and Company, New York (2003)

    MATH  Google Scholar 

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

Download references

Acknowledgment

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

Authors

Corresponding author

Correspondence to Hiroyoshi Miwa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Yamasaki, T., Miwa, H. (2018). Method for Determining Recovery Order Against Intermittent Link Failures. In: Barolli, L., Woungang, I., Hussain, O. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-65636-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65636-6_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-65635-9

  • Online ISBN: 978-3-319-65636-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics