Data allocation method considering server performance and data access frequency with consistent hashing

Abstract

As the network scale expands, operation support system (OSS) will need to handle more data queries and much larger quantities of data. Distributed data storage is a key OSS technology that makes OSS highly scalable and provides high performance. Many data allocation methods have been proposed to achieve load-balancing of servers and a short response time. Consistent hashing is one effective method of data allocation, especially when the number of system devices frequently changes. However, existing methods still cause an unbalanced server load and an increase in response time because consistent hashing does not address server performance. Furthermore, these methods do not consider dynamic changes in data access frequency. We proposes a data allocation method using virtual nodes with consistent hashing that takes server performance and data access frequency into account. Simulation results showed that the proposed method achieves much better load-balancing of servers and a shorter response time than existing methods.