Design And Simulation On Load Balancing P2P Network Game Communication Algorithm

From the end of 20 th century,online game has been developing rapidly,the further development of Chinese broadband network construction and the increasing of the number of players have made higher requests for the quality of online game platform.However,most communicate system of online game is base on the traditional centralized architecture,which cannot satisfy the current needs on reliability and fluency.Although there were many algorithms on handling,and made a certain results,but has little contribution to the upgrade of load balancing and speed.On one hand,these algorithms did not consider the heterogeneity,perturbation and proximity of the player nodes;on the other hand,coordinator-based load balancing algorithm also cannot avoid the single point failure problem,and it cannot achieve the fully distributed architecture.This paper from the perspective of player's proximity of nodes to better upgrade the P2 P network loading balancing.This paper discussed the system design problem of the load balancing for DHT-based P2 P network.In the first place,a new load balancing algorithms which considers the proximity of nodes has been developed to solve this problem.Past load balancing algorithm ignores the proximity of the nodes,which results in the low efficiency and speed of the algorithm.The new algorithm is based on the strategy of virtualized server,and improves the current one-on-one model transfer strategy to many-to-many model.When one node is experiencing heavy load,the nearest appropriate light load node will be selected by greedy algorithm to accomplish load-sharing,and therefore reduce the transfer consumption among nodes.Moreover,this paper also implements the load balancing algorithm based on the proximity of the nodes.By constructing the fully distributed k-ary tree and sequentially calling the NIC subsystem to collect system information from leaf node to root node,calling NTD subsystem to find heavy loaded node,calling NLA subsystem to produce load transfer information and calling NLM to make the transfer according to information from NLA.Finally,this paper also proposes a simulation testing plan to verify the practicability of the algorithm.In this plan,Peersim structures overlay network,and the K-Tree N class which inherits from Peersim's node interface is implemented.The load balancing algorithm which considers the proximity of nodes implemented by K-Tree N class,and simulation configuration file,data monitoring class and protocol class are also written to implement this simulation plan.Results have shown that the new algorithm proposed by this paper has greatly reduced the load balancing trade-off and increase the load balancing speed.