Cheating in networked computer games
Authors:
Open Access
- 19 September 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 105-112
Abstract
The increasing popularity of Massively Multiplayer Online Games (MMOG) -- games involving thousands of players participating simultaneously in a single virtual world - has highlighted the scalability bottlenecks present in centralised Client/Server (C/S) architectures. Researchers are proposing Peer-to-Peer (P2P) architectures as a scalable alternative to C/S; however, P2P is more vulnerable to cheating as it decentralises the game state and logic to un-trusted peer machines, rather than using trusted centralised servers. Cheating is a major concern for online games, as a minority of cheaters can potentially ruin the game for all players. In this paper we present a review and classification of known cheats, and provide real-world examples where possible. Further, we discuss counter measures used by C/S architectures to prevent cheating. Finally, we discuss several P2P architectures designed to prevent cheating, highlighting their strengths and weaknesses.Keywords
This publication has 13 references indexed in Scilit:
- Enhanced mirrored servers for network games2007
- Challenges in peer-to-peer gamingACM SIGCOMM Computer Communication Review, 2007
- A systematic classification of cheating in online games2005
- Addressing cheating in distributed MMOGs2005
- Engineering EverQuest: online gaming demands heavyweight data centersIEEE Spectrum, 2005
- Analysis of state exposure control to prevent cheating in online games2004
- Low latency and cheat-proof event ordering for peer-to-peer games2004
- The effects of latency on online madden NFL football2004
- A cheat controlled protocol for centralized online multiplayer games2004
- Is runtime verification applicable to cheat detection?2004