Consistent hashing with bounded loads and virtual nodes-based load balancing strategy for proxy cache cluster

2020 ◽  
Vol 23 (4) ◽  
pp. 3139-3155
Author(s):  
Min Xiang ◽  
Yuzhou Jiang ◽  
Zhong Xia ◽  
Chunmei Huang
Keyword(s):  
Load Balancing ◽  
Proxy Cache ◽  
Consistent Hashing

Research of Load Balancing Based on NOSQL Database

2014 ◽  
Vol 602-605 ◽  
pp. 3371-3374
Author(s):  
Peng Wang ◽  
Yan Qi
Keyword(s):  
Load Balancing ◽  
Distributed Storage ◽  
Storage System ◽  
Sql Server ◽  
Distributed Storage System ◽  
Nosql Database ◽  
Consistent Hashing ◽  
Cache Hit Ratio ◽  
Hashing Algorithm ◽  
Balancing Principle

The NOSQL database to support data and high concurrent read and write,scalability and high availability features in a distributed storage system which has been applied widely. In this paper, through the research of load balancing in distributed storage system,and it proposes the consistent hashing algorithm and the virtual node strategy, in order to improve the load balancing of the system and increase the cache hit ratio. For the load balancing principle of NOSQL and SQL Server, analysis and comparison of the experimental data.The result shows that, with the increase of the number of virtual nodes, the cache hit ratio of NOSQL is higher than the cache hit ratio of SQL Server.

Research of Cloud Storage and Improved Distributed Strategy of Data Storage

2014 ◽  
Vol 496-500 ◽  
pp. 1812-1816 ◽  
Author(s):  
Hong Xia Mao
Keyword(s):  
Load Balancing ◽  
Data Storage ◽  
Cloud Storage ◽  
Storage System ◽  
Utilization Rate ◽  
Consistent Hashing ◽  
Storage Node ◽  
Load Rate ◽  
Hashing Algorithm ◽  
System Prototype

In this paper, an extensible system prototype of cloud storage is designed. Considering the load balance of cloud storage system, an improved data storage strategy based on consistent hashing algorithm is proposed in this paper. The strategy adopts virtual nodes to storage data and real–time monitoring of load rate of each storage node to adjust load balancing of the whole storage system. In the improved strategy, the priority is introduced into the storage system to rapidly improve the utilization rate of the new storage nodes. The strategy can effectively optimize the performance of the whole storage system, and improve the overall effect of the load balancing.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document