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

  • Motoyuki OhmoriEmail author
  • Satoshi Fujio
  • Masayuki Higashino
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 927)


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.


  1. 1.
    Hesselink, W.H.: A classification of the nilpotent triangular matrices. Compos. Math. 55(1), 89–133 (1985)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Mills, D.: Network Time Protocol (Version 3) Specification, Implementation and Analysis. RFC 1305 (Draft Standard). Obsoleted by RFC 5905, March 1992Google Scholar
  3. 3.
    Pemmaraju, S., Skiena, S.: Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, Cambridge (2003)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Motoyuki Ohmori
    • 1
    Email author
  • Satoshi Fujio
    • 1
  • Masayuki Higashino
    • 1
  1. 1.Tottori UniversityTottoriJapan

Personalised recommendations