Redundancy of Routing Information on the Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method

In this paper, redundancy of routing information on the distributed key-value store based on order preserving linear hashing and Skip Graph with the load balancing method is evaluated. In this system, data are divided by order preserving linear hashing and Skip Graph is used for overlay network. For load balancing, by storing many Skip Graph nodes in one physical node, any highest-load Skip Graph can be divided. By this method, load balancing can be done. But the number of Skip Graph nodes becomes very many, redundancy of routing information is expected. In this paper, redundant routing elements are classified and redundancy of the routing information is experimentally evaluated.

[1]  Witold Litwin,et al.  Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.

[2]  Shinji Shimojo,et al.  Range-Key Extension of the Skip Graph , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[3]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[4]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[5]  15th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2016, Okayama, Japan, June 26-29, 2016 , 2016, ICIS.

[6]  Tatsuo Tsuji,et al.  A Routing Algorithm for Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph , 2016 .

[7]  Tatsuo Tsuji,et al.  Correctness of the routing algorithm for distributed key-value store based on order preserving linear hashing and skip graph , 2017, 2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD).

[8]  Tatsuo Tsuji,et al.  Performance evaluation of routing algorithms for distributed key-value store based on order preserving linear hashing and Skip graph , 2016, 2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS).

[9]  Walter A. Burkhard,et al.  Interpolation-based index maintenance , 1983, BIT.

[10]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[11]  Tatsuo Tsuji,et al.  A distributed linear hashing enabling efficient retrieval for range queries , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[12]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[13]  J. T. Robinson,et al.  Order preserving linear hashing using dynamic key statistics , 1985, PODS.

[14]  Tatsuo Tsuji,et al.  A Load Balancing Method for Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph , 2019, 2019 20th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD).

[15]  Prashant Malik,et al.  Cassandra: a decentralized structured storage system , 2010, OPSR.

[16]  Tatsuo Tsuji,et al.  An Implementation and Evaluation of Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph , 2015 .

[17]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.