WEKO3
アイテム
Effective Route Scheme of Multicast Probing to Locate High-loss Links in OpenFlow Networks
https://ipsj.ixsq.nii.ac.jp/records/209412
https://ipsj.ixsq.nii.ac.jp/records/209412820ee92c-ad73-46bd-91f3-5c0fbc491533
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2021 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Journal(1) | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2021-02-15 | |||||||||||
タイトル | ||||||||||||
タイトル | Effective Route Scheme of Multicast Probing to Locate High-loss Links in OpenFlow Networks | |||||||||||
タイトル | ||||||||||||
言語 | en | |||||||||||
タイトル | Effective Route Scheme of Multicast Probing to Locate High-loss Links in OpenFlow Networks | |||||||||||
言語 | ||||||||||||
言語 | eng | |||||||||||
キーワード | ||||||||||||
主題Scheme | Other | |||||||||||
主題 | [特集:ネットワークサービスと分散処理] active measurement, multicast measurement, flow statistics, OpenFlow network | |||||||||||
資源タイプ | ||||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
資源タイプ | journal article | |||||||||||
著者所属 | ||||||||||||
Kyushu Institute of Technology | ||||||||||||
著者所属 | ||||||||||||
Kyushu Institute of Technology | ||||||||||||
著者所属 | ||||||||||||
Kyushu Institute of Technology | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
Kyushu Institute of Technology | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
Kyushu Institute of Technology | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
Kyushu Institute of Technology | ||||||||||||
著者名 |
Nguyen, Minh Tri
× Nguyen, Minh Tri
× Masahiro, Shibata
× Masato, Tsuru
|
|||||||||||
著者名(英) |
Nguyen, Minh Tri
× Nguyen, Minh Tri
× Masahiro, Shibata
× Masato, Tsuru
|
|||||||||||
論文抄録 | ||||||||||||
内容記述タイプ | Other | |||||||||||
内容記述 | The prevalence of cloud computing and contents delivery networking has led to demand for OpenFlow-based centrally-managed networks with dynamic and flexible traffic engineering. Maintaining a high level of network service quality requires detecting and locating high-loss links. Therefore, in this paper, a measurement framework is proposed to promptly locate all high-loss links with a minimized load on both data-plane and control-plane incurred by the measurement, which assumes only standard OpenFlow functions. It combines an active measurement by probing multicast packets along a designed route and a passive measurement by collecting flow-stats of the probing flow at selected switch ports in an appropriate sequential order to access switches. In particular, by designing the measurement route based on the backbone-and-branch tree (BBT) route scheme, the measurement accuracy and the measurement overhead (the number of accesses to switches until locating all high-loss links) can be balanced. The numerical simulation demonstrates the effectiveness of our proposal. ------------------------------ 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.29(2021) (online) DOI http://dx.doi.org/10.2197/ipsjjip.29.115 ------------------------------ |
|||||||||||
論文抄録(英) | ||||||||||||
内容記述タイプ | Other | |||||||||||
内容記述 | The prevalence of cloud computing and contents delivery networking has led to demand for OpenFlow-based centrally-managed networks with dynamic and flexible traffic engineering. Maintaining a high level of network service quality requires detecting and locating high-loss links. Therefore, in this paper, a measurement framework is proposed to promptly locate all high-loss links with a minimized load on both data-plane and control-plane incurred by the measurement, which assumes only standard OpenFlow functions. It combines an active measurement by probing multicast packets along a designed route and a passive measurement by collecting flow-stats of the probing flow at selected switch ports in an appropriate sequential order to access switches. In particular, by designing the measurement route based on the backbone-and-branch tree (BBT) route scheme, the measurement accuracy and the measurement overhead (the number of accesses to switches until locating all high-loss links) can be balanced. The numerical simulation demonstrates the effectiveness of our proposal. ------------------------------ 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.29(2021) (online) DOI http://dx.doi.org/10.2197/ipsjjip.29.115 ------------------------------ |
|||||||||||
書誌レコードID | ||||||||||||
収録物識別子タイプ | NCID | |||||||||||
収録物識別子 | AN00116647 | |||||||||||
書誌情報 |
情報処理学会論文誌 巻 62, 号 2, 発行日 2021-02-15 |
|||||||||||
ISSN | ||||||||||||
収録物識別子タイプ | ISSN | |||||||||||
収録物識別子 | 1882-7764 |