Simulation of Area of Interest Management for Massively Multiplayer Online Games Using OPNET

In recent years, there has been an important growth of online gaming. Today’s Massively Multiplayer Online Games (MMOGs) can contain millions of synchronous players scattered across the world and participating with each other within a single shared game. The increase in the number of players in MMOGs has led to some issues with the demand of server which generates a significant increase in costs for the game industry and impacts to the quality of service offered to players. With the number of players gradually increasing, servers still need to work efficiently under heavy load and, new researches are required to improve the established MMOG system architectures. In dealing with a considerable scale of massively multiplayer online games, several client-server and peer-to-peer solutions have been proposed. Although they have improved the scalability of MMOGs in different degrees, they faced new serious challenges in interest management. In this paper, we propose a novel static area of interest management in order to reduce the delay and traffic of Hybrid P2P MMOGs. We propose to use OPNET Modeler 18.0, and in particular the custom application to simulate the new architecture, which required the implementation of new nodes models and behaviors in the simulator to emulate correctly the new architecture. The scenarios include both client-server and hybrid P2P system to evaluate the communication of games with (125, 500, and 1000) peers. The simulation results show that area of interest management for MMOGs based on the hybrid P2P architectures have low delay and traffic received compared with MMOGs based on client-server system

Dynamic lookahead mechanism for conserving power in multi-player mobile games

Ministry of Education, Singapore under its Academic Research Funding Tier

A Visibility-Driven Approach to Managing Interest in Distributed Simulations with Dynamic Load Balancing

Distributed Simulations that support a massive number of users typically divide the virtual world into zones that are managed by separate servers to evenly distribute resources and achieve scalability. However, such zoning restricts cross-zonal interactions and exposes the division of the world to the participating parties. Problems such as crowding one zone among others defeats the very purpose of interest management and makes geographic partitioning inefficient for modeling interactions. In this work, we have designed and implemented a visibility-driven approach to make the partitioning transparent to users. The effectiveness of this distributed architecture is tested through a prototype implementation. We also introduce a novel idea to dynamic load balancing that can be achieved in real-time without modifying the communication architecture. By increasing the granularity of the partitioning and providing a layered approach to zoning, transient crowding can be handled by adaptively dispersing parts of the crowded zone to adjacent servers. 1

Scalable Resource and QoS Brokering Mechanisms for Massively Multiplayer Online Games

Multiplayer online games have become an increasingly integral part of online entertainment. With advances in social media, the number of players of these games is increasing at a very rapid rate, which in some cases has been observed to be exponential. This is when resource becomes a concern. In this thesis, I investigated several challenges in developing and maintaining multiplayer games such as hotspots, genrespeci c limitations, unpredictable quality of service and rigidity in resource availability. I showed that these issues can be solved by adopting mechanisms for separation of resource concerns from functional concerns and coordination of resources. To support resource coordination, I divided the ownership of resources among three partiesgame owner, resource owner and game player. I developed the CyberOrgs-MMOG API, which supports Massively Multiplayer Online Game (MMOG) platforms capable of resource sharing among multiple peers, through mechanisms for acquiring these resources dynamically. I showed that dynamic acquisition of resources can solve the resource questions mentioned above. The API was evaluated using a 2D game with up to 250 simulated players. I also showed, how the game's responsiveness can be dynamically adjusted in a scalable way. This thesis presents the design and implementation of the CyberOrgs-MMOG API, interfaces provided to the interacting agents representing di erent parties. I integrated a 2D multiplayer game with the API and evaluated the mechanisms supported by the API

Heuristics for Client Assignment and Load Balancing Problems in Online Games

Massively multiplayer online games (MMOGs) have been very popular over the past decade. The infrastructure necessary to support a large number of players simultaneously playing these games raises interesting problems to solve. Since the computations involved in solving those problems need to be done while the game is being played, they should not be so expensive that they cause any noticeable slowdown, as this would lead to a poor player perception of the game. Many of the problems in MMOGs are NP-Hard or NP-Complete, therefore we must develop heuristics for those problems without negatively affecting the player experience as a result of excessive computation. In this dissertation, we focus on a few of the problems encountered in MMOGs – the Client Assignment Problem (CAP) and both centralized and distributed load balancing – and develop heuristics for each. For the CAP we investigate how best to assign players to servers while meeting several conditions for satisfactory play, while in load balancing we investigate how best to distribute load among game servers subject to several criteria. In particular, we develop three heuristics - a heuristic for a variant of the CAP called Offline CAP-Z, a heuristic for centralized load balancing called BreakpointLB, and a heuristic for distributed load balancing called PLGR. We develop a simulator to simulate the operations of an MMOG and implement our heuristics to measure performance against adapted heuristics from the literature. We find that in many cases we are able to produce better results than those adapted heuristics, showing promise for implementation into production environments. Further, we believe that these ideas could also be easily adapted to the numerous other problems to solve in MMOGs, and they merit further consideration and augmentation for future research

Dynamic Load Balancing for Massively Multiplayer Online Games

In recent years, there has been an important growth of online gaming. Today’s Massively Multiplayer Online Games (MMOGs) can contain millions of synchronous players scattered across the world and participating with each other within a single shared game. Traditional Client/Server architectures of MMOGs exhibit different problems in scalability, reliability, and latency, as well as the cost of adding new servers when demand is too high. P2P architecture provides considerable support for scalability of MMOGs. It also achieves good response times by supporting direct connections between players. This thesis proposes a novel hybrid Peer-to-Peer architecture for MMOGs and a new dynamic load balancing for massively multiplayer online games (MMOGs) based this hybrid Peer-to-Peer architecture. We have divided the game world space into several regions. Each region in the game world space is controlled and managed by using both a super-peer and a clone-super-peer. The region's super-peer is responsible for distributing the game update among the players inside the region, as well as managing the game communications between the players. However, the clone-super-peer is responsible for controlling the players' migration from one region to another, in addition to be the super-peer of the region when the super-peer leaves the game. In this thesis, we have designed and simulated a static and dynamic Area of Interest Management (AoIM) for MMOGs based on both architectures hybrid P2P and client-server with the possibility of players to move from one region to another. In this thesis also, we have designed and evaluated the static and dynamic load balancing for MMOGs based on hybrid P2P architecture. We have used OPNET Modeler 18.0 to simulate and evaluate the proposed system, especially standard applications, custom applications, TDMA and RX Group. Our dynamic load balancer is responsible for distributing the load among the regions in the game world space. The position of the load balancer is located between the game server and the regions. The results, following extensive experiments, show that low delay and higher traffic communication can be achieved using both of hybrid P2P architecture, static and dynamic AoIM, dynamic load balancing for MMOGs based on hybrid P2P system