FreeMMG: A Scalable and Cheat-Resistant Distribution Model for Internet Games

Cecin, F.R.; Real, Rodrigo; Jannone, Rafael de O.; Geyer, Cláudio F. R.; Martins, Márcio Garcia; Barbosa, Jorge Luís Victória

doi:10.1109/ds-rt.2004.21

Cited by 26 publications

(16 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Depending on the synchronization algorithm used to support game sessions on action spaces, individual players could manipulate the game to gain unfair advantages, like returning to the social space with an additional arbitrary amount of virtual money. This problem can be mitigated if replicated simulation with player input synchronization is used [6,10]. If events are executed in the exact same order, using exactly the same simulation timestamps on the simulators of all nodes, then only one honest node is needed for the server-side to detect that an inconsistency has occurred and thus be able to deny the results offered by the instanced game session [6].…”

Section: The Instanced Game Modelmentioning

confidence: 99%

“…This problem can be mitigated if replicated simulation with player input synchronization is used [6,10]. If events are executed in the exact same order, using exactly the same simulation timestamps on the simulators of all nodes, then only one honest node is needed for the server-side to detect that an inconsistency has occurred and thus be able to deny the results offered by the instanced game session [6]. However, this still leaves the possibility of occurrence of collusion cheats [6,10,21], where all replicas agree to perform illegal manipulations to the game state simultaneously.…”

Section: The Instanced Game Modelmentioning

confidence: 99%

“…If events are executed in the exact same order, using exactly the same simulation timestamps on the simulators of all nodes, then only one honest node is needed for the server-side to detect that an inconsistency has occurred and thus be able to deny the results offered by the instanced game session [6]. However, this still leaves the possibility of occurrence of collusion cheats [6,10,21], where all replicas agree to perform illegal manipulations to the game state simultaneously. This risk can be further mitigated with the use of witness nodes [6,10], which are additional replicas allocated randomly to an instanced game session to reduce the probability that all nodes will perform a synchronized illegal change to the simulator's state.…”

Section: The Instanced Game Modelmentioning

confidence: 99%

See 2 more Smart Citations

A peer-to-peer simulation technique for instanced massively multiplayer games

Cecin

Geyer

Rabello

et al. 2006

2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications

View full text Add to dashboard Cite

We propose a peer-to-peer event ordering and simulation technique aimed at networked real-time action games. Partially based on replicated simulators, its goal is to support decentralized playout in small-scale game sessions on instanced action spaces while being resistant to collusion cheating. The action spaces are linked to persistent-state social spaces of larger scale which are supported by centralized simulation. Together, these two kinds of spaces offer support for massively multiplayer on-line games (MMOGs) that offer a mix of socialization on large-scale persistent environments and fast interaction on small-scale temporary ones. Although player nodes on action spaces are required to run a conservative and an optimistic simulator simultaneously, we show that 2.2 simultaneous simulation steps are executed on average and that 11.95 simultaneous steps occur as the average peak situation for 20-player sessions with 150ms to 300ms network delays between nodes, 5% probability of any late events introducing errors, and rollback and re-execution operations having their execution spreaded through 100ms of real time or longer.

show abstract

Section: The Instanced Game Modelmentioning

confidence: 99%

Section: The Instanced Game Modelmentioning

confidence: 99%

Section: The Instanced Game Modelmentioning

confidence: 99%

See 1 more Smart Citation

A peer-to-peer simulation technique for instanced massively multiplayer games

Cecin

Geyer

Rabello

et al. 2006

2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications

View full text Add to dashboard Cite

show abstract

“…Many of the proposed P2P-based MMOG architectures are designed for scalability, but do not adequately handle the security of the system [1,2,4,7,9,14,15,20,27,31]. In addition, several of the proposed mechanisms to address cheating in P2P MMOGs are ad hoc solutions that cannot be adopted in other systems [3,11,26].…”

Section: Introductionmentioning

confidence: 99%

Towards Formalizing a Reputation System for Cheating Detection in Peer-to-Peer-Based Massively Multiplayer Online Games

Susilo

Chow

Wiangsripanawan

2012

Network and System Security

View full text Add to dashboard Cite

. Towards formalizing a reputation system for cheating detection in peer-to-peerbased massively multiplayer online games. Lecture Notes in Computer Science, 7645 291-304.Towards formalizing a reputation system for cheating detection in peer-topeer-based massively multiplayer online games AbstractThe rapidly growing popularity of Massively Multiplayer Online Games (MMOGs) has given rise to an increase in the number of players world wide. MMOGs enable many players interact together through a shared sense of presence created by the game. The Peer-to-Peer (P2P) network topology overcomes communication bottleneck problems associated with centralized client/server sys-tems. Thus, P2P-based MMOGs are seen as the way of the future, and many dierent P2P-based MMOG architectures have been proposed to date. However, many architectures are proposed in an ad hoc manner and enhancing the security of such systems is an elusive research problem. In this paper, we address this important issue by making the following contributions. Firstly, we formalize the notion of P2P-based MMOGs and demonstrate that existing P2P-based MMOG architectures can be unied using our model. To our knowledge, this is the rst time that this has been done in the literature. Secondly, we use our model to develop a real-time cheating detection mechanism to identify cheating players, which can be used to expose several MMOG cheating strategies. Finally, we propose a new reputation based system for P2P-based MMOGs to enhance the cheating detection process. Abstract. The rapidly growing popularity of Massively Multiplayer Online Games (MMOGs) has given rise to an increase in the number of players world wide. MMOGs enable many players interact together through a shared sense of presence created by the game. The Peer-to-Peer (P2P) network topology overcomes communication bottleneck problems associated with centralized client/server systems. Thus, P2P-based MMOGs are seen as the way of the future, and many different P2P-based MMOG architectures have been proposed to date. However, many architectures are proposed in an ad hoc manner and enhancing the security of such systems is an elusive research problem. In this paper, we address this important issue by making the following contributions. Firstly, we formalize the notion of P2P-based MMOGs and demonstrate that existing P2P-based MMOG architectures can be unified using our model. To our knowledge, this is the first time that this has been done in the literature. Secondly, we use our model to develop a real-time cheating detection mechanism to identify cheating players, which can be used to expose several MMOG cheating strategies. Finally, we propose a new reputation based system for P2P-based MMOGs to enhance the cheating detection process.

show abstract

“…DaCAP (Liu and Lo, 2008) and FreeMMG (Cecin et al, 2004) rely on mutual monitoring among all players concerned, rather than a limited number of referees. They organise players into 'legal groups' according to their locality in the game world.…”

Section: Reactive Approachesmentioning

confidence: 99%

Design issues for Peer-to-Peer Massively Multiplayer Online Games

Lü

Trinder

Taylor

2010

IJAMC

View full text Add to dashboard Cite

Massively Multiplayer Online Games (MMOGs) are increasing in both popularity and scale, and while classical Client/Server (C/S) architectures convey some benefits, they suffer from significant technical and commercial drawbacks. This realisation has sparked intensive research interest in adapting MMOGs to Peer-to-Peer (P2P) architectures. This paper articulates a comprehensive set of six design issues to be addressed by P2P MMOGs, namely Interest Management (IM), game event dissemination, Non-Player Character (NPC) host allocation, game state persistency, cheating mitigation and incentive mechanisms. Design alternatives for each issue are systematically compared, and their interrelationships discussed. We further evaluate how well representative P2P MMOG architectures fulfil the design criteria.

show abstract

FreeMMG: A Scalable and Cheat-Resistant Distribution Model for Internet Games

Cited by 26 publications

References 8 publications

A peer-to-peer simulation technique for instanced massively multiplayer games

A peer-to-peer simulation technique for instanced massively multiplayer games

Towards Formalizing a Reputation System for Cheating Detection in Peer-to-Peer-Based Massively Multiplayer Online Games

Design issues for Peer-to-Peer Massively Multiplayer Online Games

Contact Info

Product

Resources

About