SFB: a scalable method for handling range queries on Skip Graphs

Banno, Ryohei; Fujino, Tomoyuki; Takeuchi, Susumu; Takemoto, Minoru

doi:10.1587/comex.4.14

Cited by 12 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Except for Chord or DHTs, many overlay network techniques have been researched [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. Skip graphs are overlay networks for which a skip list is applied in the P2P model [9][10][11][12][13][14].…”

Section: Other Overlay Network Techniquesmentioning

confidence: 99%

“…As the techniques to realize high scalability, overlay network construction techniques have been proposed such as distributed hash tables (DHTs), skip graphs, and geographical-based ones [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. Those techniques construct logical networks among nodes based on the specific information of each node such as a one-dimensional ID and multi-dimensional attribute values.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Node Virtualization Scheme for Structured Overlay Networks Based on Multiple Different Time Intervals

Kawakami

2020

Applied Sciences

View full text Add to dashboard Cite

Sensor data which relate to the specific geographical positions, areas, and time are strongly expected in IoT. The author has studied overlay networks to efficiently process interval queries which have specific time intervals and the actual users tend to request. However, unfairness and a concentration of the loads occur for the specific processing computer (node) in the previous method because the density of data or those generators/providers is different from those related values. In this paper, the author proposes the enhanced scheme for structured overlay networks based on multiple different time intervals. The proposed method uses node virtualization to equalize the loads of each real (physical) node. The simulation results showed that the proposed method can increase the fairness of the number of the assigned data among physical nodes.

show abstract

Section: Other Overlay Network Techniquesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Node Virtualization Scheme for Structured Overlay Networks Based on Multiple Different Time Intervals

Kawakami

2020

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…As shown in [6], there are two efficient methods for handling range queries on Skip Graph: Multi-Range Forwarding (MRF) and Split-Forward Broadcasting (SFB). Difference of the two methods is shown in Figure 4.…”

Section: B Range Queries On Skip Graphmentioning

confidence: 99%

Comparison of subscriber assignment methods on scalable distributed Pub/Sub systems

Banno

Kawano

Takeuchi

et al. 2015

2015 21st Asia-Pacific Conference on Communications (APCC)

Self Cite

View full text Add to dashboard Cite

Scalable messaging methods for IoT services are needed to accommodate a vast number of devices. Skip Graph based topic based pub/sub (SG-TPS), which utilizes multiple brokers composing a structured overlay network, is one of the promising candidates. In SG-TPS, the distribution delay time is widely influenced by a way to assign subscribers to each broker. There are two possible approaches: the intensive assignment by which subscribers having a same topic are accommodated on a same broker, and the extensive assignment by which the subscribers are accommodated on different brokers as far as possible. In this paper, we formulate the difference of the distribution delay time between these two approaches, and discuss about the optimization of subscriber assignment.

show abstract

“…The average number of hops to search peers based on a key is log n in skip graphs while n denotes the number of peers. Currently many researchs exist to enhance the skip graphsas [12]- [14].…”

Section: A Ideamentioning

confidence: 99%

A P2P Sensor Data Stream Delivery System to Accommodate Heterogeneous Cycles Using Skip Graphs

Kawakami

Ishi

Yoshihisa

et al. 2015

2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)

View full text Add to dashboard Cite

In this paper, we propose a method using skip graphs to delivery sensor data streams with heterogeneous delivery cycles. Currently skip graphs have been proposed as one of structured overlay networks that construct links among nodes based on a specific rule. The proposed method sorts nodes by their delivery cycles and constructs delivery paths based on skip graphs. We confirmed in simulation that our proposed method can delivery sensor data with heterogeneous cycles using skip graphs to distribute the load of source node.

show abstract

SFB: a scalable method for handling range queries on Skip Graphs

Cited by 12 publications

References 3 publications

A Node Virtualization Scheme for Structured Overlay Networks Based on Multiple Different Time Intervals

A Node Virtualization Scheme for Structured Overlay Networks Based on Multiple Different Time Intervals

Comparison of subscriber assignment methods on scalable distributed Pub/Sub systems

A P2P Sensor Data Stream Delivery System to Accommodate Heterogeneous Cycles Using Skip Graphs

Contact Info

Product

Resources

About