@techreport{oai:ipsj.ixsq.nii.ac.jp:00080764,
 author = {TranAnhPhuong and Yuuichi, Teranishi and Kaname, Harumoto and Shojiro, Nishio and Tran, AnhPhuong and Yuuichi, Teranishi and Kaname, Harumoto and Shojiro, Nishio},
 issue = {47},
 month = {Feb},
 note = {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., 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.},
 title = {A Proposal of Skip Graph extension for load balancing distributed interval matching},
 year = {2012}
}