Low latency and cheat-proof event ordering for peer-to-peer games

We are developing a distributed architecture for massivelymultiplayer games. In this paper, we focus on designing a low-latency event ordering protocol, called NEO, for this architecture. Previous event ordering protocols prevent several types of cheats at the expense of operating at the latency of the slowest player. We broaden the definition of cheating to include four common protocol level cheats and demonstrate how NEO prevents these cheats. At the same time, NEO has a playout latency independent of network conditions and adapts to network congestion to optimize performance. Categories and Subject Descriptors: C.2.1 [Network Architecture and Design]:Distributed networks, C.2.4 [Distributed Systems]:Distributed applications, I.6.8 [Types of Simulation]:Gaming General Terms: Algorithms, Performance, Security

• Type: Conference
• Year: 2004
• Where: NOSSDAV
• Authors: Chris GauthierDickey, Daniel Zappala, Virginia Mary Lo, James Marr
• Keywords: Distributed Architecture, Event Ordering Protocols, NOSSDAV 2004, Operating Systems, Protocol Level Cheats