A Proposal of Skip Graph extension for load balancing distributed interval matching

• Item type: SIG Technical Reports(1)
• 公開日: 2012-02-22
• タイトル: A Proposal of Skip Graph extension for load balancing distributed interval matching
• タイトル / 言語: en
• タイトル: A Proposal of Skip Graph extension for load balancing distributed interval matching
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: オーバレイネットワーク
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Osaka University
• 著者所属: National Institute of Information and Communications Technology／Osaka University
• 著者所属: Osaka University
• 著者所属: Osaka University
• 著者所属(英): en
• 著者所属(英): Osaka University
• 著者所属(英): en
• 著者所属(英): National Institute of Information and Communications Technology / Osaka University
• 著者所属(英): en
• 著者所属(英): Osaka University
• 著者所属(英): en
• 著者所属(英): Osaka University
• 著者名: TranAnhPhuong; Yuuichi, Teranishi; Kaname, Harumoto; Shojiro, Nishio
• 著者名(英): Tran, AnhPhuong; Yuuichi, Teranishi; Kaname, Harumoto; Shojiro, Nishio
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: In this research, we propose a new overlay network for processing distributed intervals matching, which is an important task in distributed Content Based Publish Subscribe system (CBPS) or sensor data sharing. Previous methods often required high cost in maintaining the balance of the delivery tree, especially in systems where the subscribing intervals are skewed. A few approaches based on Skip Graph addressed this problem, but they imposed highly unbalanced workload on nodes or introduce high latency during retrieving value. By extending the Skip Graph with additional states on each level, we enable it to respond to request faster with lower cost in a more balanced fashion. We evaluated the proposal method by simulation and confirmed the method's effectiveness compared to existing approaches.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: In this research, we propose a new overlay network for processing distributed intervals matching, which is an important task in distributed Content Based Publish Subscribe system (CBPS) or sensor data sharing. Previous methods often required high cost in maintaining the balance of the delivery tree, especially in systems where the subscribing intervals are skewed. A few approaches based on Skip Graph addressed this problem, but they imposed highly unbalanced workload on nodes or introduce high latency during retrieving value. By extending the Skip Graph with additional states on each level, we enable it to respond to request faster with lower cost in a more balanced fashion. We evaluated the proposal method by simulation and confirmed the method's effectiveness compared to existing approaches.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN10116224
• 書誌情報: 研究報告マルチメディア通信と分散処理（DPS）; 巻 2012-DPS-150, 号 47, p. 1-8, 発行日 2012-02-22
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会