Designing Overlay Networks for Handling Exhaust Data in a Distributed Topic-based Pub/Sub Architecture

• Item type: Journal(1)
• 公開日: 2015-02-15
• タイトル: Designing Overlay Networks for Handling Exhaust Data in a Distributed Topic-based Pub/Sub Architecture
• タイトル / 言語: en
• タイトル: Designing Overlay Networks for Handling Exhaust Data in a Distributed Topic-based Pub/Sub Architecture
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [特集：ネットワークサービスと分散処理] distributed pub/sub, overlay networks, Skip Graph, relay-free, exhaust data, IoT
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: NTT Network Innovation Laboratories, NTT Corporation
• 著者所属: NTT Network Innovation Laboratories, NTT Corporation
• 著者所属: NTT Network Innovation Laboratories, NTT Corporation
• 著者所属: NTT Network Innovation Laboratories, NTT Corporation
• 著者所属: NTT Science and Core Technology Laboratory Group, NTT Corporation
• 著者所属: NTT Network Innovation Laboratories, NTT Corporation
• 著者所属(英): en
• 著者所属(英): NTT Network Innovation Laboratories, NTT Corporation
• 著者所属(英): en
• 著者所属(英): NTT Network Innovation Laboratories, NTT Corporation
• 著者所属(英): en
• 著者所属(英): NTT Network Innovation Laboratories, NTT Corporation
• 著者所属(英): en
• 著者所属(英): NTT Network Innovation Laboratories, NTT Corporation
• 著者所属(英): en
• 著者所属(英): NTT Science and Core Technology Laboratory Group, NTT Corporation
• 著者所属(英): en
• 著者所属(英): NTT Network Innovation Laboratories, NTT Corporation
• 著者名: Ryohei, Banno; Susumu, Takeuchi; Michiharu, Takemoto; Tetsuo, Kawano; Takashi, Kambayashi; Masato, Matsuo
• 著者名(英): Ryohei, Banno; Susumu, Takeuchi; Michiharu, Takemoto; Tetsuo, Kawano; Takashi, Kambayashi; Masato, Matsuo
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: To provide event-driven services in IoT, scalable methods of topic-based pub/sub messaging are indispensable. Methods using structured overlay networks are promising candidates. However, existing methods have the problem of wasting network resources, because they lack adaptivity to “exhaust data,” which have low or no value most of the time. The problem contains two aspects. One is that each publisher node continues to forward data to a relay node even if there are no subscribers. The other is that excessively large multicast trees are constructed for low value data, which will be received by only a small number of subscribers. In this paper, we formulate the desirable design of overlay networks by defining a property called “strong relay-free” as an expansion of relay-free property. The property involves publishers and subscribers composing connected subgraphs to enable detecting the absence of subscribers and autonomously adjusting the tree size. We also propose a practical method satisfying the property by using Skip Graph, and evaluate it through simulation experiments. We confirmed that the proposed method can suspend publishing adaptively, and shorten the path length on multicast trees by more than 75% under an experimental condition with 100,000 nodes.; ------------------------------; 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.23(2015) No.2 (online); ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: To provide event-driven services in IoT, scalable methods of topic-based pub/sub messaging are indispensable. Methods using structured overlay networks are promising candidates. However, existing methods have the problem of wasting network resources, because they lack adaptivity to “exhaust data,” which have low or no value most of the time. The problem contains two aspects. One is that each publisher node continues to forward data to a relay node even if there are no subscribers. The other is that excessively large multicast trees are constructed for low value data, which will be received by only a small number of subscribers. In this paper, we formulate the desirable design of overlay networks by defining a property called “strong relay-free” as an expansion of relay-free property. The property involves publishers and subscribers composing connected subgraphs to enable detecting the absence of subscribers and autonomously adjusting the tree size. We also propose a practical method satisfying the property by using Skip Graph, and evaluate it through simulation experiments. We confirmed that the proposed method can suspend publishing adaptively, and shorten the path length on multicast trees by more than 75% under an experimental condition with 100,000 nodes.; ------------------------------; 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.23(2015) No.2 (online); ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 56, 号 2, 発行日 2015-02-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764