Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

The Deepest Vertex First Reboot: Rebooting Network Edge Switches in a Campus Network

  • Conference paper
  • First Online:
Web, Artificial Intelligence and Network Applications (WAINA 2019)

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

  • 2666 Accesses

Abstract

Network edge switches require to be rebooted for some reasons, e.g., updating a firmware, configuring a special behavior and so on. This paper proposes the deepest vertex first reboot that can reboot many network switches with less overhead downtime. The deepest vertex first reboot can reduce downtime overhead by vertex contraction. The deepest vertex first reboot then enables to reboot all switches by only 13-s overhead where the under-estimated ideal minimum downtime is 75 s in an actual campus network where there are more than 300 network equipment.

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

Similar content being viewed by others

References

  1. Hesselink, W.H.: A classification of the nilpotent triangular matrices. Compos. Math. 55(1), 89–133 (1985)

    MathSciNet  MATH  Google Scholar 

  2. Mills, D.: Network Time Protocol (Version 3) Specification, Implementation and Analysis. RFC 1305 (Draft Standard). Obsoleted by RFC 5905, March 1992

    Google Scholar 

  3. Pemmaraju, S., Skiena, S.: Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tottori University, Koyama-minami, Tottori, 680-8550, Japan

    Motoyuki Ohmori, Satoshi Fujio & Masayuki Higashino

Authors
  1. Motoyuki Ohmori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoshi Fujio
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masayuki Higashino
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Motoyuki Ohmori .

Editor information

Editors and Affiliations

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

    Leonard Barolli

  2. Department of Advanced Sciences, Hosei University, Koganei-Shi, Tokyo, Japan

    Makoto Takizawa

  3. Department of Computer Science, Technical University of Catalonia, Barcelona, Barcelona, Spain

    Fatos Xhafa

  4. Faculty of Business Administration, Rissho University, Tokyo, Japan

    Tomoya Enokido

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ohmori, M., Fujio, S., Higashino, M. (2019). The Deepest Vertex First Reboot: Rebooting Network Edge Switches in a Campus Network. In: Barolli, L., Takizawa, M., Xhafa, F., Enokido, T. (eds) Web, Artificial Intelligence and Network Applications. WAINA 2019. Advances in Intelligent Systems and Computing, vol 927. Springer, Cham. https://doi.org/10.1007/978-3-030-15035-8_14

Download citation

Publish with us

Policies and ethics

Search

Navigation