Show simple item record

dc.contributor.authorWebb, Steven
dc.contributor.authorSoh, Sieteng
dc.contributor.authorTrahan, J.
dc.identifier.citationWebb, Steven Daniel and Soh, Sieteng and Trahan, Jerry L. 2009. Secure referee selection for fair and responsive peer-to-peer gaming. Simulation. 85 (9): pp. 608-618.

Peer-to-Peer (P2P) architectures for Massively Multiplayer Online Games (MMOG) provide better scalability than Client/Server (C/S); however, they increase the possibility of cheating. Recently proposed P2P protocols use trusted referees that simulate/validate the game to provide security equivalent to C/S. When selecting referees from untrusted peers, selecting non-colluding referees becomes critical. Further, referees should be selected such that the range and length of delays to players is minimised (maximising game fairness and responsiveness). In this paper we formally define the referee selection problem and propose two secure referee selection algorithms, SRS-1 and SRS-2, to solve it. Both algorithms ensure the probability of corrupt referees controlling a zone/region is below a predefined limit, while attempting to maximise responsiveness and fairness. The trade-off between responsiveness and fairness is adjustable for both algorithms. Simulations of three different scenarios show the effectiveness of our algorithms.

dc.publisherSage Publications
dc.titleSecure referee selection for fair and responsive peer-to-peer gaming
dc.typeJournal Article

The final, definitive version of this paper has been published in Simulation, 85 (9), June/2009 by SAGE Publications Ltd, All rights reserved. ©

curtin.accessStatusOpen access
curtin.facultySchool of Science and Computing
curtin.facultyDepartment of Computing
curtin.facultyFaculty of Science and Engineering

Files in this item


This item appears in the following Collection(s)

Show simple item record