WEKO3
アイテム
Comparative Evaluation of Dataflow Component Selection Methods in Distributed MQTT Broker Environment
https://ipsj.ixsq.nii.ac.jp/records/214356
https://ipsj.ixsq.nii.ac.jp/records/2143560eefc341-fc3f-4381-a586-6b96aa70a8fa
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2021 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Journal(1) | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2021-12-15 | |||||||||||||||
タイトル | ||||||||||||||||
タイトル | Comparative Evaluation of Dataflow Component Selection Methods in Distributed MQTT Broker Environment | |||||||||||||||
タイトル | ||||||||||||||||
言語 | en | |||||||||||||||
タイトル | Comparative Evaluation of Dataflow Component Selection Methods in Distributed MQTT Broker Environment | |||||||||||||||
言語 | ||||||||||||||||
言語 | eng | |||||||||||||||
キーワード | ||||||||||||||||
主題Scheme | Other | |||||||||||||||
主題 | [一般論文] edge computing, Pub/Sub, structured overlay network | |||||||||||||||
資源タイプ | ||||||||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||
資源タイプ | journal article | |||||||||||||||
著者所属 | ||||||||||||||||
Graduate School of Frontier Informatics, Kyoto Sangyo University | ||||||||||||||||
著者所属 | ||||||||||||||||
Graduate School of Frontier Informatics, Kyoto Sangyo University | ||||||||||||||||
著者所属 | ||||||||||||||||
Graduate School of Engineering, Osaka City University | ||||||||||||||||
著者所属 | ||||||||||||||||
National Institute of Information and Communications Technology | ||||||||||||||||
著者所属 | ||||||||||||||||
Graduate School of Frontier Informatics, Kyoto Sangyo University | ||||||||||||||||
著者所属(英) | ||||||||||||||||
en | ||||||||||||||||
Graduate School of Frontier Informatics, Kyoto Sangyo University | ||||||||||||||||
著者所属(英) | ||||||||||||||||
en | ||||||||||||||||
Graduate School of Frontier Informatics, Kyoto Sangyo University | ||||||||||||||||
著者所属(英) | ||||||||||||||||
en | ||||||||||||||||
Graduate School of Engineering, Osaka City University | ||||||||||||||||
著者所属(英) | ||||||||||||||||
en | ||||||||||||||||
National Institute of Information and Communications Technology | ||||||||||||||||
著者所属(英) | ||||||||||||||||
en | ||||||||||||||||
Graduate School of Frontier Informatics, Kyoto Sangyo University | ||||||||||||||||
著者名 |
Shintaro, Ishihara
× Shintaro, Ishihara
× Kazuma, Yasuda
× Kota, Abe
× Yuuichi, Teranishi
× Toyokazu, Akiyama
|
|||||||||||||||
著者名(英) |
Shintaro, Ishihara
× Shintaro, Ishihara
× Kazuma, Yasuda
× Kota, Abe
× Yuuichi, Teranishi
× Toyokazu, Akiyama
|
|||||||||||||||
論文抄録 | ||||||||||||||||
内容記述タイプ | Other | |||||||||||||||
内容記述 | Internet of Things applications often require reducing the communication delay and the traffic between sensors and actuators. In addition, research and development of dataflow platforms is ongoing. In these platforms, to meet the aforementioned requirements, geographically distributed dataflow components should be connected appropriately using edge computing environments. Existing approaches provide efficient communication considering the geographical distance using a distributed publish/subscribe broker that uses the peer-to-peer overlay; however, they do not consider resource information. In this paper, we propose two component selection methods - Multicast and Anycast - for inter-component communication considering resource information. Multicast selects a component by collecting resource information before selection, while Anycast selects a component using the aggregated resource information together with the overlay maintenance. We evaluated the hop count and amount of traffic using each method. As a result, we clarified that Anycast provides a smaller number of hops than Multicast when the aggregated values are sufficiently updated or there are sufficient available components. Furthermore, we examined how to use Anycast and Multicast considering the traffic volume against the sending interval of the component reservation request and the interval between sending the update query for maintaining the overlay. The sender node can choose the component selection method based on the number of hops and the traffic volume. ------------------------------ 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.787 ------------------------------ |
|||||||||||||||
論文抄録(英) | ||||||||||||||||
内容記述タイプ | Other | |||||||||||||||
内容記述 | Internet of Things applications often require reducing the communication delay and the traffic between sensors and actuators. In addition, research and development of dataflow platforms is ongoing. In these platforms, to meet the aforementioned requirements, geographically distributed dataflow components should be connected appropriately using edge computing environments. Existing approaches provide efficient communication considering the geographical distance using a distributed publish/subscribe broker that uses the peer-to-peer overlay; however, they do not consider resource information. In this paper, we propose two component selection methods - Multicast and Anycast - for inter-component communication considering resource information. Multicast selects a component by collecting resource information before selection, while Anycast selects a component using the aggregated resource information together with the overlay maintenance. We evaluated the hop count and amount of traffic using each method. As a result, we clarified that Anycast provides a smaller number of hops than Multicast when the aggregated values are sufficiently updated or there are sufficient available components. Furthermore, we examined how to use Anycast and Multicast considering the traffic volume against the sending interval of the component reservation request and the interval between sending the update query for maintaining the overlay. The sender node can choose the component selection method based on the number of hops and the traffic volume. ------------------------------ 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.787 ------------------------------ |
|||||||||||||||
書誌レコードID | ||||||||||||||||
収録物識別子タイプ | NCID | |||||||||||||||
収録物識別子 | AN00116647 | |||||||||||||||
書誌情報 |
情報処理学会論文誌 巻 62, 号 12, 発行日 2021-12-15 |
|||||||||||||||
ISSN | ||||||||||||||||
収録物識別子タイプ | ISSN | |||||||||||||||
収録物識別子 | 1882-7764 |