A scalable dynamic load distribution scheme for multi-server distributed virtual environment systems with highly-skewed user distribution
Kyungmin Lee, Dongman Lee
Abstract
Kyungmin Lee, Dongman Lee
Abstract
This paper proposes and evaluates a scalable dynamic load distribution scheme for multi-server distributed virtual environment systems, where users are highly skewed rather than uniformly distributed over a virtual environment. In the proposed scheme, an overloaded server initiating load distribution selects a set of servers to be involved in load distribution by dynamically adapting to the workload status of other servers, unlike the existing approaches. Upon completion of server selection, the intiating server repartitions the regions dedicated to the involved servers using a graph partitioning algorithm so that all the involved servers have the roughly equal workload. The involved servers then migrate their workloads with each other in a peer-to-peer manner according to the result of repartitioning. We present and analyze the simulation results that compare the performance of the proposed scheme with that of the existing schemes.
OpenAlex reports 58 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper proposes and evaluates a scalable dynamic load distribution scheme for multi-server distributed virtual environment systems, where users are highly skewed rather than uniformly distributed over a virtual environment. In the proposed scheme, an overloaded server initiating load distribution selects a set of servers to be involved in load distribution by dynamically adapting to the workload status of other servers, unlike the existing approaches. Upon completion of server selection, the intiating server repartitions the regions dedicated to the involved servers using a graph partitioning algorithm so that all the involved servers have the roughly equal workload. The involved servers then migrate their workloads with each other in a peer-to-peer manner according to the result of repartitioning. We present and analyze the simulation results that compare the performance of the proposed scheme with that of the existing schemes.
Key concepts: Server, Computer science, Scalability, Workload, Distributed computing, Server farm, Load balancing (electrical power), Scheme (mathematics)