A load balancing scheme for massively multiplayer online games
- 254 Downloads
In a distributed MMOG (massively multiplayer online game) server architecture, the server nodes may become easily overloaded by the high demand from the players for state updates. Many works propose algorithms to distribute the load on the server nodes, but this load is usually defined as the number of players on each server, what is not an ideal measure. Also, the possible heterogeneity of the system is frequently overlooked. We propose a balancing scheme with two main goals: allocate load on server nodes proportionally to each one’s power and reduce the inter-server communication overhead, considering the load as the occupied bandwidth of each server. Four algorithms were proposed, from which ProGReGA is the best for overhead reduction and ProGReGA-KF is the most suited for reducing player migrations between servers. We also make a review of related works and some comparisons were made, where our approach performed better.
KeywordsMMOGs Load balancing Distributed server Graph partitioning
This work was supported by the National Research Council (CNPq) and by the Coordination of Improvement of Higher Education (CAPES), both Brazilian research funding agencies.
- 2.Bettstetter C, Hartenstein H, Pérez-Costa X (2002) Stochastic properties of the random waypoint mobility model: epoch length, direction distribution, and cell change rate. In: Proceedings of the ACM international workshop on modeling analysis and simulation of wireless and mobile systems, vol 5. ACM, Atlanta, pp 7–14CrossRefGoogle Scholar
- 4.Chen J, Wu B, Delap M, Knutsson B, Lu H, Amza C (2005) Locality aware dynamic load management for massively multiplayer games. In: Proceedings of the 10th ACM SIGPLAN symposium on principles and practice of parallel programming. ACM, New York, pp 289–300Google Scholar
- 7.Duong T, Zhou S (2003) A dynamic load sharing algorithm for massively multiplayer online games. In: Proceedings of the 11th IEEE international conference on networks, pp 131–136Google Scholar
- 8.Feder T et al (1999) Complexity of graph partition problems. In: Proceedings of the ACM Symposium on Theory of Computing, STOC, vol 31. ACM, New York, pp 464–472Google Scholar
- 9.Feng W (2007) What’s next for networked games? http://www.thefengs.com/wuchang/work/. (NetGames 2007 keynote talk, nov. 2007)
- 10.Fiduccia C, Mattheyses R (1982) A linear-time heuristic for improving network partitions. In: Proceedings of the conference on design automation, vol 19. ACM, New York, pp 175–181Google Scholar
- 13.Kernighan B, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307Google Scholar
- 14.Lee K, Lee D (2003)A scalable dynamic load distribution scheme for multi-server distributed virtual environment systems with highly-skewed user distribution. In: Proceedings of the ACM symposium on virtual reality software and technology. ACM, New York, pp 160–168Google Scholar
- 15.Lu F, Parkin S, Morgan G (2006) Load balancing for massively multiplayer online games. In: Proceedings of the 5th ACM SIGCOMM workshop on network and system support for games. ACM, New YorkGoogle Scholar
- 16.Microsoft (1997) Age of empires. http://www.microsoft.com/games/empires/