講演名 | 2018-09-04 The Equal Longest Path First Reboot 大森 幹之(鳥取大), 東野 正幸(鳥取大), |
---|---|
PDFダウンロードページ | PDFダウンロードページへ |
抄録(和) | 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. |
抄録(英) | 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. |
キーワード(和) | Network switch / availability / firmware update / certificate replacement / maintenance reboot |
キーワード(英) | Network switch / availability / firmware update / certificate replacement / maintenance reboot |
資料番号 | IA2018-29 |
発行日 | 2018-08-27 (IA) |
研究会情報 | |
研究会 | IA |
---|---|
開催期間 | 2018/9/3(から2日開催) |
開催地(和) | 北海道大学学術交流会館 |
開催地(英) | Hokkaido Univ. Conference Hall |
テーマ(和) | インターネット運用・管理、一般 (JANOG協催) |
テーマ(英) | Internet Operation and Management, etc. |
委員長氏名(和) | 飯田 勝吉(北大) |
委員長氏名(英) | Katsuyoshi Iida(Hokkaido Univ.) |
副委員長氏名(和) | 新 麗(IIJ) / 大崎 博之(関西学院大) / 近堂 徹(広島大) |
副委員長氏名(英) | Rei Atarashi(IIJ) / Hiroyuki Osaki(Kwansei Gakuin Univ.) / Toru Kondo(Hiroshima Univ.) |
幹事氏名(和) | 作元 雄輔(首都大東京) / 屏 雄一郎(トヨタIT) / 渡辺 俊貴(NEC) |
幹事氏名(英) | Yusuke Sakumoto(Tokyo Metropolitan Univ.) / Yuichiro Hei(TOYOTA-IT) / Toshiki Watanabe(NEC) |
幹事補佐氏名(和) | 大平 健司(徳島大) / 坂野 遼平(東工大) |
幹事補佐氏名(英) | Kenji Ohira(Tokushima Univ.) / Ryohei Banno(Tokyo Inst. of Tech.) |
講演論文情報詳細 | |
申込み研究会 | Technical Committee on Internet Architecture |
---|---|
本文の言語 | ENG |
タイトル(和) | |
サブタイトル(和) | |
タイトル(英) | The Equal Longest Path First Reboot |
サブタイトル(和) | Rebooting Network Edge Switches in a Campus Network |
キーワード(1)(和/英) | Network switch / Network switch |
キーワード(2)(和/英) | availability / availability |
キーワード(3)(和/英) | firmware update / firmware update |
キーワード(4)(和/英) | certificate replacement / certificate replacement |
キーワード(5)(和/英) | maintenance reboot / maintenance reboot |
第 1 著者 氏名(和/英) | 大森 幹之 / Motoyuki Ohmori |
第 1 著者 所属(和/英) | 鳥取大学(略称:鳥取大) Tottori University(略称:Tottori Univ.) |
第 2 著者 氏名(和/英) | 東野 正幸 / Masayuki Higashino |
第 2 著者 所属(和/英) | 鳥取大学(略称:鳥取大) Tottori University(略称:Tottori Univ.) |
発表年月日 | 2018-09-04 |
資料番号 | IA2018-29 |
巻番号(vol) | vol.118 |
号番号(no) | IA-204 |
ページ範囲 | pp.83-89(IA), |
ページ数 | 7 |
発行日 | 2018-08-27 (IA) |