Papers
Topics
Authors
Recent
Search
2000 character limit reached

Multiplayer Games and their Need for Scalable and Secure State Management

Published 7 May 2015 in cs.CY and cs.CR | (1505.01864v1)

Abstract: In recent years, massively multiplayer online games (MMOGs) have become very popular by providing more entertainment, therefore millions of players now participate may interact with each other in a shared environment, even though these players may be separated by huge geographic distances. Peer to Peer (P2P) architectures become very popular in MMOG recently, due to their distributed and collaborative nature, have low infrastructure costs, achieve fast response times by creating direct connections between players and can achieve high scalability. However, P2P architectures face many challenges and tend to be vulnerable to cheating. Game distribution between peers makes maintaining control of the game becomes more complicated. Therefore, broadcasting all state changes to every player is not a viable solution to maintain a consistent game state in a MMOGs. To successfully overcome the challenge of scale, MMOGs have to employ sophisticated interest management techniques that only send relevant state changes to each player. In this paper, In order to prevent cheaters to gain unfair advantages in P2P-based MMOGs, several cheat-proof schemes have been proposed that utilize a range of techniques such as cryptographic mechanisms, Commitment and agreement protocols, and proxy architecture.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.