Abstract
Distributed Virtual Environment Systems are widely used in massively multiplayer online games. With an efficient distributed architecture and load balancing algorithm, they can support tens of thousands of players interacting with each other. An existing prevalent mechanism is to divide the virtual world into several regions and microcells and use the graph-based partitioning algorithm. But they generally limit the assignment beginning with border nodes and can’t adapt to the situation when players are crowded around the center of the entire map. Furthermore, many algorithms simply focus on reducing the intra-server communication cost in a connected graph. In this paper, we propose an adaptive load balancing algorithm to solve the problem of the center-crowdedness in the DVE systems, while reducing the intra-server communication and client migration cost simultaneously.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggrawl G, Motwani R, Zhu A (2003) The load balancing problem. In: Proceedings of ACM symposium on parallel algorithms and architectures, pp 258–265
Lety E, Turletti T, Baccelli F (1999) Cell-based multicast grouping in large-scale virtual environments, Technical Report No. 3729, INRIA, France
Vleeschauwer B, Bossche V, Verdickt T, Turck F, Dhoedt B, Demeester P (2005) Dynamic microcell assignment for massively multiplayer online gaming. In: Proceedings of the 4th ACM SIGCOMM workshop on network and system support for games, pp 1–7
Lui J, Chan M (2002) An efficient partitioning algorithm for distributed virtual environment systems. IEEE Trans Parallel Distrib Syst 13(3):193–211
Chen J, Wu B, Delap M, Knutsson B, Ku 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, pp 289–300
Ye M, Cheng L (2006) System-performance modeling for massively multiplayer online role-playing games. IBM Syst J 45(1):45–58
Bezerra C, Geyer C (2009) A load balancing scheme for massively multiplayer online games. Multimedia Tools Appl 45:263–289
Ta D, Zhou S, Shen H (2006) Greedy algorithms for client assignment in large-scale distributed virtual environments. In: Proceedings of the 20th workshop on principles of advanced and distributed simulation, pp 103–110
Huang J, Du Y, Wang C (2003) Design of the server cluster to support avatar migration. In: Processing IEEE virtual reality, pp 7–14
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Kim, TH. (2013). Adaptive Load Partitioning Algorithm for Massively Multiplayer Online Games. In: Kim, K., Chung, KY. (eds) IT Convergence and Security 2012. Lecture Notes in Electrical Engineering, vol 215. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5860-5_47
Download citation
DOI: https://doi.org/10.1007/978-94-007-5860-5_47
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5859-9
Online ISBN: 978-94-007-5860-5
eBook Packages: EngineeringEngineering (R0)