ログイン
Language:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 学術雑誌論文
  2. 5 技術(工学)

On Reducing Measurement Load on Control-Plane in Locating High Packet-Delay Variance Links for OpenFlow Networks

http://hdl.handle.net/10228/00008734
http://hdl.handle.net/10228/00008734
af03160e-71e4-4db9-9f2a-7140eca53aff
名前 / ファイル ライセンス アクション
RECN_2020-33.pdf RECN_2020-33.pdf (600.2 kB)
アイテムタイプ 学術雑誌論文 = Journal Article(1)
公開日 2022-02-21
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
タイトル
タイトル On Reducing Measurement Load on Control-Plane in Locating High Packet-Delay Variance Links for OpenFlow Networks
言語 en
言語
言語 eng
著者 Nguyen, Minh Tri

× Nguyen, Minh Tri

WEKO 32547

en Nguyen, Minh Tri

Search repository
Nguyen, Viet Ha

× Nguyen, Viet Ha

WEKO 32548

en Nguyen, Viet Ha

Search repository
柴田, 将拡

× 柴田, 将拡

WEKO 25091
e-Rad_Researcher 10806095
Scopus著者ID 55538897600
ORCiD 0000-0003-1414-8033
九工大研究者情報 100001003

en Shibata, Masahiro

ja 柴田, 将拡

ja-Kana シバタ, マサヒロ


Search repository
鶴, 正人

× 鶴, 正人

WEKO 5853
e-Rad_Researcher 40231443
Scopus著者ID 7005093872
ORCiD 0000-0001-7340-6798

ja 鶴, 正人

en Tsuru, Masato

ja-Kana ツル, マサト


Search repository
Kawaguchi, Akira

× Kawaguchi, Akira

WEKO 32551

en Kawaguchi, Akira

Search repository
抄録
内容記述タイプ Abstract
内容記述 We previously proposed a method to locate high packet-delay variance links for OpenFlow networks by probing multicast measurement packets along a designed route and by collecting flow-stats of the probe packets from selected OpenFlow switches (OFSs). It is worth noting that the packet-delay variance of a link is estimated based on arrival time intervals of probe packets without measuring delay times over the link. However, the previously used route scheme based on the shortest path tree may generate a probing route with many branches in a large network, resulting in many accesses to OFSs to locate all high delay variance links. In this paper, therefore, we apply an Eulerian cycle-based scheme which we previously developed, to control the number of branches in a multicast probing route. Our proposal can reduce the load on the control-plane (i.e., the number of accesses to OFSs) while maintaining an acceptable measurement accuracy with a light load on the data-plane. Additionally, the impacts of packet losses and correlated delays over links on those different types of loads are investigated. By comparing our proposal with the shortest path tree-based and the unicursal route schemes through numerical simulations, we evaluate the advantage of our proposal.
備考
内容記述タイプ Other
内容記述 9th International Conference on Emerging Internet, Data & Web Technologies (EIDWT-2021), 25-27 February, 2021, Chiang Mai, Thailand(オンライン開催に変更)
書誌情報 Lecture Notes on Data Engineering and Communications Technologies

巻 65, p. 232-245, 発行日 2021-02-19
出版社
出版者 Springer, Cham
DOI
関連タイプ isVersionOf
識別子タイプ DOI
関連識別子 https://doi.org/10.1007/978-3-030-70639-5_22
ISBN
識別子タイプ ISBN
関連識別子 978-3-030-70638-8
ISBN
識別子タイプ ISBN
関連識別子 978-3-030-70639-5
日本十進分類法
主題Scheme NDC
主題 547
著作権関連情報
権利情報 Copyright (c) The Author(s), under exclusive license to Springer Nature Switzerland AG 2021 This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes on Data Engineering and Communications Technologies. The final authenticated version is available online at: http://dx.doi.org/10.1007/978-3-030-70639-5_22.
出版タイプ
出版タイプ AM
出版タイプResource http://purl.org/coar/version/c_ab4af688f83e57aa
査読の有無
値 yes
連携ID
値 8983
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 13:04:23.255723
Show All versions

Share

Share
tweet

Cite as

Other

print

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX
  • ZIP

コミュニティ

確認

確認

確認


Powered by WEKO3


Powered by WEKO3