WEKO3
アイテム
A Multicast Tree Management Method Supporting Fast Failure Recovery and Dynamic Group Membership Changes in OpenFlow Networks
https://ipsj.ixsq.nii.ac.jp/records/158147
https://ipsj.ixsq.nii.ac.jp/records/158147030e55af-6e39-4062-854b-99c7b927e970
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
|
|
Copyright (c) 2016 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-03-15 | |||||||||||
| タイトル | ||||||||||||
| タイトル | A Multicast Tree Management Method Supporting Fast Failure Recovery and Dynamic Group Membership Changes in OpenFlow Networks | |||||||||||
| タイトル | ||||||||||||
| 言語 | en | |||||||||||
| タイトル | A Multicast Tree Management Method Supporting Fast Failure Recovery and Dynamic Group Membership Changes in OpenFlow Networks | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | [一般論文] centralized management, multicast tree management, Fast Reroute, OpenFlow | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | journal article | |||||||||||
| 著者所属 | ||||||||||||
| Graduate School of Informatics, Kyoto University | ||||||||||||
| 著者所属 | ||||||||||||
| Cloud System Research Laboratories, NEC Corporation/Graduate School of Information Systems, The University of Electro-Communications | ||||||||||||
| 著者所属 | ||||||||||||
| Cloud System Research Laboratories, NEC Corporation | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Graduate School of Informatics, Kyoto University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Cloud System Research Laboratories, NEC Corporation / Graduate School of Information Systems, The University of Electro-Communications | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Cloud System Research Laboratories, NEC Corporation | ||||||||||||
| 著者名 |
Daisuke, Kotani
× Daisuke, Kotani
× Kazuya, Suzuki
× Hideyuki, Shimonishi
|
|||||||||||
| 著者名(英) |
Daisuke, Kotani
× Daisuke, Kotani
× Kazuya, Suzuki
× Hideyuki, Shimonishi
|
|||||||||||
| 論文抄録 | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | We propose a multicast tree management method in an OpenFlow controller that handles both fast failure recovery and dynamic multicast group membership changes. Multicast communication is an efficient tool to distribute data to many hosts in various services such as live video streaming. To use multicast in such services, multicast communication must be reliable, which means multicast communication should be restored quickly after failures, and multicast tree management mechanism should support frequent group membership changes. A conventional approach, Point to Multipoint (P2MP) MPLS, only supports fast failure recovery for reliability, and is not very effective in terms of group membership changes. A new approach using OpenFlow supports dynamic group membership changes, but does not consider fast failure recovery in physical switches whose flow entry modification is slow. Our proposed method is to control multicast trees centrally, and it uses a precomputation and pre-installation approach for tree management. A controller calculates and keeps multiple trees that cover all switches where receivers are potentially connected and that have less common nodes and edges, and installs their sub-trees covering switches where receivers are actually connected. The controller calculates the difference per tree between sub-trees before and after membership changes, and reflects them into the network. At the time of failure, the controller checks and finds a pre-installed tree that is unaffected by the failure, and installs a new rule only to a root switch to send packets through the pre-installed alternate tree. Our experiments using switches and our prototype controller show that our proposed method can restore packet delivery quickly after a failure, as well as that our proposed method can handle tree modifications faster than a method of recalculating or reinstalling a tree every time that group memberships are changed. \n------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.24.395 ------------------------------ |
|||||||||||
| 論文抄録(英) | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | We propose a multicast tree management method in an OpenFlow controller that handles both fast failure recovery and dynamic multicast group membership changes. Multicast communication is an efficient tool to distribute data to many hosts in various services such as live video streaming. To use multicast in such services, multicast communication must be reliable, which means multicast communication should be restored quickly after failures, and multicast tree management mechanism should support frequent group membership changes. A conventional approach, Point to Multipoint (P2MP) MPLS, only supports fast failure recovery for reliability, and is not very effective in terms of group membership changes. A new approach using OpenFlow supports dynamic group membership changes, but does not consider fast failure recovery in physical switches whose flow entry modification is slow. Our proposed method is to control multicast trees centrally, and it uses a precomputation and pre-installation approach for tree management. A controller calculates and keeps multiple trees that cover all switches where receivers are potentially connected and that have less common nodes and edges, and installs their sub-trees covering switches where receivers are actually connected. The controller calculates the difference per tree between sub-trees before and after membership changes, and reflects them into the network. At the time of failure, the controller checks and finds a pre-installed tree that is unaffected by the failure, and installs a new rule only to a root switch to send packets through the pre-installed alternate tree. Our experiments using switches and our prototype controller show that our proposed method can restore packet delivery quickly after a failure, as well as that our proposed method can handle tree modifications faster than a method of recalculating or reinstalling a tree every time that group memberships are changed. \n------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.24.395 ------------------------------ |
|||||||||||
| 書誌レコードID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AN00116647 | |||||||||||
| 書誌情報 |
情報処理学会論文誌 巻 57, 号 3, 発行日 2016-03-15 |
|||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||
| 収録物識別子 | 1882-7764 | |||||||||||