523 research outputs found

    Server assignment in mirrored server environments

    Get PDF
    Massively multiplayer online games (MMOGs) may use peer-to-peer, client-server, or mirrored-server environments. Since there exist multiple server options in mirrored server environments, a problem arises when deciding to which server each player should connect. We propose three distinct algorithms that assign players within Quality of Service (QoS) as each player joins and leaves, taking into consideration whether a player already in QoS can be moved to place a newly joining player in QoS without sacrificing QoS for the moved player. Our results show that for certain numbers of servers and values of QoS, our algorithms increase the total number of players in QoS over a static player to server assignment, and bears adapting to a wider variety of environments

    Autonomic service hosting for large-scale distributed MOVE-services

    Get PDF

    On The Study of Establishing a Responsive Infrastructure for a Massively Multiplayer On-Line Game

    Get PDF
    A massively multiplayer online game (MMOG) often requires a game publisher to deploy dozens or hundreds of n-tiered servers to support millions of concurrent players around the world. Planning such a massive network infrastructure, particularly in an environment where uncertain demand and limited server capacity could cause congestions in a host site and the network, poses a great challenge. A slow response time stemming from an ill-designed infrastructure could render an otherwise technically superior MMOG noncompetitive in the marketplace. In this study, we focus on three critical issues related to establishing an MMOG server infrastructure: selecting host facilities on a broadband provider’s backbone network nodes, assigning client clusters represented by the Point of Presences (PoPs) to these MMOG facilities, and determining the required capacity for each host site. The problem is first formulated as a non-linear integer program based on an M/M/1 queuing system in each host facility. We then develop an exact solution approach obtained from solving a minimum cost set-covering problem. The efficiency of the solution approach is also reported

    Re-engineering jake2 to work on a grid using the GridGain Middleware

    Get PDF
    With the advent of Massively Multiplayer Online Games (MMOGs), engineers and designers of games came across with many questions that needed to be answered such as, for example, "how to allow a large amount of clients to play simultaneously on the same server?", "how to guarantee a good quality of service (QoS) to a great number of clients?", "how many resources will be necessary?", "how to optimize these resources to the maximum?". A possible answer to these questions relies on the usage of grid computing. Taking into account the parallel and distributed nature of grid computing, we can say that grid computing allows for more scalability in terms of a growing number of players, guarantees shorter communication time between clients and servers, and allows for a better resource management and usage (e.g., memory, CPU, core balancing usage, etc.) than the traditional serial computing model. However, the main focus of this thesis is not about grid computing. Instead, this thesis describes the re-engineering process of an existing multiplayer computer game, called Jake2, by transforming it into a MMOG, which is then put to run on a grid

    Referee-based architectures for massively multiplayer online games

    Get PDF
    Network computer games are played amongst players on different hosts across the Internet. Massively Multiplayer Online Games (MMOG) are network games in which thousands of players participate simultaneously in each instance of the virtual world. Current commercial MMOG use a Client/Server (C/S) architecture in which the server simulates and validates the game, and notifies players about the current game state. While C/S is very popular, it has several limitations: (i) C/S has poor scalability as the server is a bandwidth and processing bottleneck; (ii) all updates must be routed through the server, reducing responsiveness; (iii) players with lower client-to-server delay than their opponents have an unfair advantage as they can respond to game events faster; and (iv) the server is a single point of failure.The Mirrored Server (MS) architecture uses multiple mirrored servers connected via a private network. MS achieves better scalability, responsiveness, fairness, and reliability than C/S; however, as updates are still routed through the mirrored servers the problems are not eliminated. P2P network game architectures allow players to exchange updates directly, maximising scalability, responsiveness, and fairness, while removing the single point of failure. However, P2P games are vulnerable to cheating. Several P2P architectures have been proposed to detect and/or prevent game cheating. Nevertheless, they only address a subset of cheating methods. Further, these solutions require costly distributed validation algorithms that increase game delay and bandwidth, and prevent players with high latency from participating.In this thesis we propose a new cheat classification that reflects the levels in which the cheats occur: game, application, protocol, or infrastructure. We also propose three network game architectures: the Referee Anti-Cheat Scheme (RACS), the Mirrored Referee Anti-Cheat Scheme (MRACS), and the Distributed Referee Anti-Cheat Scheme (DRACS); which maximise game scalability, responsiveness, and fairness, while maintaining cheat detection/prevention equal to that in C/S. Each proposed architecture utilises one or more trusted referees to validate the game simulation - similar to the server in C/S - while allowing players to exchange updates directly - similar to peers in P2P.RACS is a hybrid C/S and P2P architecture that improves C/S by using a referee in the server. RACS allows honest players to exchange updates directly between each other, with a copy sent to the referee for validation. By allowing P2P communication RACS has better responsiveness and fairness than C/S. Further, as the referee is not required to forward updates it has better bandwidth and processing scalability. The RACS protocol could be applied to any existing C/S game. Compared to P2P protocols RACS has lower delay, and allows players with high delay to participate. Like in many P2P architectures, RACS divides time into rounds. We have proposed two efficient solutions to find the optimal round length such that the total system delay is minimised.MRACS combines the RACS and MS architectures. A referee is used at each mirror to validate player updates, while allowing players to exchange updates directly. By using multiple mirrored referees the bandwidth required by each referee, and the player-to mirror delays, are reduced; improving the scalability, responsiveness and fairness of RACS, while removing its single point of failure. Direct communication MRACS improves MS in terms of its responsiveness, fairness, and scalability. To maximise responsiveness, we have defined and solved the Client-to-Mirror Assignment (CMA) problem to assign clients to mirrors such that the total delay is minimised, and no mirror is overloaded. We have proposed two sets of efficient solutions: the optimal J-SA/L-SA and the faster heuristic J-Greedy/L-Greedy to solve CMA.DRACS uses referees distributed to player hosts to minimise the publisher / developer infrastructure, and maximise responsiveness and/or fairness. To prevent colluding players cheating DRACS requires every update to be validated by multiple unaffiliated referees, providing cheat detection / prevention equal to that in C/S. We have formally defined the Referee Selection Problem (RSP) to select a set of referees from the untrusted peers such that responsiveness and/or fairness are maximised, while ensuring the probability of the majority of referees colluding is below a pre-defined threshold. We have proposed two efficient algorithms, SRS-1 and SRS-2, to solve the problem.We have evaluated the performances of RACS, MRACS, and DRACS analytically and using simulations. We have shown analytically that RACS, MRACS and DRACS have cheat detection/prevention equivalent to that in C/S. Our analysis shows that RACS has better scalability and responsiveness than C/S; and that MRACS has better scalability and responsiveness than C/S, RACS, and MS. As there is currently no publicly available traces from MMOG we have constructed artificial and realistic inputs. We have used these inputs on all simulations in this thesis to show the benefits of our proposed architectures and algorithms

    Virtutopia: A Framework for Virtual Environments

    Get PDF
    Virtutopia is a framework for the design and maintenance of persistent virtual online worlds. In this project we designed, implemented and evaluated a proposed architecture for the first stage of Virtutopia. The initial architecture provides capabilities for networking, defining objects and behaviors, receiving user input and rendering output. The outcome is a network system, utilizing a hybrid client-server peer-to-peer architecture, combined with a 3D client interface capable of interacting with other clients in the virtual world
    • …
    corecore