論文

査読有り 筆頭著者 責任著者
2015年3月15日

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

Journal of information processing
  • Ryohei Banno
  • ,
  • Susumu Takeuchi
  • ,
  • Michiharu Takemoto
  • ,
  • Tetsuo Kawano
  • ,
  • Takashi Kambayashi
  • ,
  • Masato Matsuo

23
2
開始ページ
105
終了ページ
116
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.2197/ipsjjip.23.105
出版者・発行元
一般社団法人 情報処理学会

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.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.

リンク情報
DOI
https://doi.org/10.2197/ipsjjip.23.105
CiNii Articles
http://ci.nii.ac.jp/naid/130004952409
CiNii Books
http://ci.nii.ac.jp/ncid/AA00700121
URL
http://id.nii.ac.jp/1001/00141506/

エクスポート
BibTeX RIS