| Presentation | 2018-09-04 The Equal Longest Path First Reboot Motoyuki Ohmori, Masayuki Higashino, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Even in the era of Software Defined Network (SDN) or Software Defined Infrastructure (SDI), network edge switches still requires to be rebooted for some reasons, e.g., updating a firmware, configuring a special behavior and so on. It may be necessary to clarify how ones can shorten a downtime of a campus network when many switches in the network require reboots. To this end, this paper expresses a campus network in a graph theory fashion, and contracts the graph by vertex contraction. This paper then presents how to compute a depth of a vertex by a matrix computation. This paper then proposes the procedure, the equal longest path first reboot, that minimizes a downtime of a network. This paper then introduces a prototype implementation of the proposed method, and evaluates the proposed method in an actual campus network. This paper also presents that the proposed method can minimize a downtime on the same level of the ideal minimal downtime. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Network switch / availability / firmware update / certificate replacement / maintenance reboot |
| Paper # | IA2018-29 |
| Date of Issue | 2018-08-27 (IA) |
| Conference Information | |
| Committee | IA |
|---|---|
| Conference Date | 2018/9/3(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Hokkaido Univ. Conference Hall |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Internet Operation and Management, etc. |
| Chair | Katsuyoshi Iida(Hokkaido Univ.) |
| Vice Chair | Rei Atarashi(IIJ) / Hiroyuki Osaki(Kwansei Gakuin Univ.) / Toru Kondo(Hiroshima Univ.) |
| Secretary | Rei Atarashi(Tokyo Metropolitan Univ.) / Hiroyuki Osaki(TOYOTA-IT) / Toru Kondo(NEC) |
| Assistant | Kenji Ohira(Tokushima Univ.) / Ryohei Banno(Tokyo Inst. of Tech.) |
| Paper Information | |
| Registration To | Technical Committee on Internet Architecture |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | The Equal Longest Path First Reboot |
| Sub Title (in English) | Rebooting Network Edge Switches in a Campus Network |
| Keyword(1) | Network switch |
| Keyword(2) | availability |
| Keyword(3) | firmware update |
| Keyword(4) | certificate replacement |
| Keyword(5) | maintenance reboot |
| 1st Author's Name | Motoyuki Ohmori |
| 1st Author's Affiliation | Tottori University(Tottori Univ.) |
| 2nd Author's Name | Masayuki Higashino |
| 2nd Author's Affiliation | Tottori University(Tottori Univ.) |
| Date | 2018-09-04 |
| Paper # | IA2018-29 |
| Volume (vol) | vol.118 |
| Number (no) | IA-204 |
| Page | pp.pp.83-89(IA), |
| #Pages | 7 |
| Date of Issue | 2018-08-27 (IA) |