This thesis addresses the dynamic load balancing problem in networked virtual environment servers. In previous solutions to the problem, an overloaded server gives part of its load only to the servers that are adjacent to it. When adjacent servers are all overloaded, the previous solutions need a time-consuming series of load transfers in order to balance the loads with other lightly loaded servers.
A new dynamic load balancing algorithm is proposed that splits a rectangular area serviced by an overloaded server into two rectangular areas and transfers a resulting area to any lightly loaded server. Simulation results show that this algorithm balances the loads of virtual environment servers more rapidly than previous solutions. However, our solution might result in a high replication overhead after a lot of area splits. The replication overhead is sharply decreased by a modification of our algorithm that merges two small adjacent areas into one area unless the merge does not cause an overload.
