A method for designing proximity-aware routing algorithms for structured overlays

2019 IEEE International Conference on Blockchain (Blockchain)

2019

Self Cite

Blockchains have attracted a great deal of attention as a technology for the distributed management of register information at multiple nodes without a centralized system. However, they possess the drawbacks of low transaction throughput and long approval time. These problems can be addressed by shortening the block generation interval; however, shortening this interval alone has the effect of increasing the frequency of forks. In this study, we aim to shorten the block generation interval without increasing the fork generation rate by improving the network topology of the nodes and shortening the propagation time. We propose a neighbor node selection method forming a network topology with a short block propagation time. A blockchain simulator is used to demonstrate the effect of the proposed neighbor node selection method on the propagation delay of the network. This result indicates that the proposed method improves block propagation time.

Section: Proposed Algorithmmentioning

confidence: 99%

Proximity Neighbor Selection in Blockchain Networks

Aoki

2019 IEEE International Conference on Blockchain (Blockchain)

2019

Self Cite

“…In a homogeneous environment such as a local area network and a cloud network, a routing path length dominates the latency. In contrast, note that locality awareness [12], [13], [14], which considers the proximity of the underlying network, is also important in a non-homogeneous environment on the Internet. Regarding fault tolerance, it is effective to use the stabilization methods [15].…”

Section: Introductionmentioning

confidence: 99%

Detouring Skip Graph: Efficient Routing via Detour Routes on Skip Graph Topology

Kaneko

Banno

IEEE Open J. Commun. Soc.

et al. 2020

Self Cite

Skip graph is a distributed data structure that provides a scalable structured overlay network by routing in logarithmic time for resource location and dynamic node addition/deletion. However, most of the routing paths are quite longer than the shortest paths because each node in the network knows only its neighbors, rather than the global topology. In general, long routing paths lead to the high latency and the low fault tolerance. Herein, we propose Detouring Skip Graph, which performs more efficient routing through the use of detour routes. It does not require construction of extra links or modification of its topology; thereby, it shortens the paths without additional costs while maintaining the advantages of Skip Graph. Our evaluation experiments show that the proposed method tends to shorten the paths considerably, and in particular, that the average path length is approximately 20%-30% shorter than that of Skip Graph.

“…Using sticky entry sieves, we redesign existing algorithms, group FRT-Chord (GFRT-Chord) [8] and proximity-aware FRT-Chord (PFRT-Chord) [10], and we design their merged algorithms, PGFRT-Chord and GPFRT-Chord, which varies from PGFRT-Chord only with reespect to the sieve order. We also implement and examine the merged algorithm.…”

Section: Introductionmentioning

confidence: 99%

Mergeable flexible routing tables: A design framework for reusable structured overlay algorithms

Nagao

2015 International Conference on Information Networking (ICOIN)

2015

Self Cite

In structured overlay networks with millions of nodes, it is essential to optimize the extent to which routing paths are shortened for more efficient message routing. However, various metrics, such as the physical positions of nodes, network latencies, node lifespan, and node availability, other than the number of hops, can be considered. Methods have been proposed to efficiently design extended algorithms that consider metrics other than the number of hops. However, a real world application requires a suitable set of metrics, and the set varies by application.We propose mergeable flexible routing tables (mergeable-FRT), a routing algorithm design framework for structured overlays, which supports the efficient design of algorithms. Mergeable-FRT-based extended algorithms can be designed by merging existing algorithms, so that algorithms with new metrics or algorithms to which are added new metrics can be designed by reusing existing algorithms.In mergeable-FRT, algorithms are defined using a sequence of sticky entry sieve functions and can be merged by merging these sequences. However, when these sequences are merged repeatedly, the effect of extensions is much stronger than the effect of path length reduction, and the number of hops progressively increases. Mergeable-FRT therefore defines a minimum through parameter to control the effect of sticky entry sieves and supports the balancing of the effect due to extensions with that due to the reduction of path length. For mergeable-FRT algorithms based on FRT-Chord with arbitrary extensions, we prove that the path length is O(log |N |) by configuring a minimum through parameter when routing tables are converged.Using sticky entry sieves, we design and implement group FRT-Chord (GFRT-Chord) and proximity-aware FRT-Chord (PFRT-Chord) and their merged algorithms, PGFRT-Chord and GPFRT-Chord. Experimental results show that the extended algorithms have merged features inherited from the original algorithms and that the minimum through parameter supports control of the effect of extensions.