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

Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video

Volumn , Issue , 2004, Pages 134-139

  GauthierDickey, Chris ^a   Zappala, Daniel ^a   Lo, Virginia ^a   Marr, James ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

Cheat proof; Distributed; Games; Interactive; Low latency; Peer to peer

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); MULTI AGENT SYSTEMS; NETWORK PROTOCOLS; ONLINE SYSTEMS; OPTIMIZATION; QUALITY CONTROL; SYNCHRONIZATION;

CHEAT-PROOF EVENT ORDERING; LOW-LATENCY; MASSIVELY MULTIPLAYER ONLINE GAMES (MMOG); NEW EVENT ORDERING (NEO); PEER-TO-PEER GAMES; SERVER COMMUNICATION ARCHITECTURE;

GAME THEORY;

EID: 4544240978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005847.1005877     Document Type: Conference Paper

References (14)

1. N. E. Baughman and B. N. Levine. Cheat-proof Playout for Centralized and Distributed Online Games. In IEEE Infocom, 2001.
2. P. Bettner and M. Terrano. 1500 archers on a 28.8: Network Programming in the Age of Empires and Beyond. In Game Developer's Conference, March 2001.
3. A. R. Bharambe, S. Rao, and S. Seshan, Mercury: A Scalable Publish-Subscribe System for Internet Games. In 1st workshop on Network and System Support for Games, pages 3-9. ACM Press, 2002.
4. E. Cronin, B. Filstrup, and S. Jamin. Cheat-Proofing Dead Reckoned Multiplayer Games. In Intl. Conf. on Application and Development of Computer Games, January 2003.
5. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area Cooperative Storage with CFS. In Proceedings of SOSP, Oct 2001.
6. C. Diot and L. Gautier. A Distributed Architecture for Multiplayer Interactive Applications on the Internet. IEEE Networks, 13(4), July/August 1999.
7. C. GauthierDickey, D. Zappala, V. Lo, and J. Marr. Low-Latency and Cheat-Proof Event Ordering for Distributed Games. Technical Report CIS-TR-2004-2, University of Oregon.
8. L. Gautier, C. Diot, and J. Kurose. End-to-End Transmission Control Mechanisms for Multiparty Interactive Applications on the internet. In IEEE Infocom, 1999.
9. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. OceanStore: An Architecture for Global-Scale Persistent Storage. In ACM ASPLOS, November 2000.
10. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. In ACM Transactions on Programming Languages and Systems, pages 382-401, July 1982.
11. V. Lo, D. Zappala, D. Zhou, Y. Liu, and S. Zhao. Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet. In IPTPS, March 2004.
12. J. Postel. Network Time Protocol. RFC 1305, March 1992.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A Scalable Content-Addressable Network. In ACM SIGCOMM, 2001.
14. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In ACM SIGCOMM, pages 149-160. ACM Press, 2001.