Article

Using n-trees for scalable event ordering in peer-to-peer games

Authors:

Chris GauthierDickey,

Daniel ZappalaAuthors Info & Claims

NOSSDAV '05: Proceedings of the international workshop on Network and operating systems support for digital audio and video

Pages 87 - 92

https://doi.org/10.1145/1065983.1066005

Published: 13 June 2005 Publication History

Abstract

We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at least two rounds of communication \cite{keidar01}. Multiplayer games add real-time constraints to this scenario. To meet this challenge, we develop an event scoping mechanism that uses N-Trees for event propagation. Unlike traditional application-layer multicast, N-Trees organize peers by their application-level scope of interest, instead of by their delay-based shortest-path tree. This organization allows peers which are close by in the virtual world to order events without needing to communicate with other peers that are farther away. We show the asymptotic analysis of N-Trees indicates that they will perform well for scalable peer-to-peer event ordering. We also provide an analysis of N-Trees in comparison to other distributed architectures for peer-to-peer games.

References

[1]

S. Banerjee, B. Bhattacharjee, and C. Kommareddy. Scalable application layer multicast. In Proceedings of ACM SIGCOMM, pages 205--217. ACM Press, 2002.

Digital Library

[2]

N. E. Baughman and B. N. Levine.q Cheat-proof Playout for Centralized and Distributed Online Games. In INFOCOM, pages 104--113, 2001.

[3]

A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting Scalable Multi-Attribute Range Queries. In Proceedings of ACM SIGCOMM, August 2004.

Digital Library

[4]

M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC), 2002.

Digital Library

[5]

W. Chang Feng, F. Chang, W. chi Feng, and J. Walpole. Provisioning on-line games: A traffic analysis of a busy counter-strike server. In ACM Internet Measurement Workshop, 2002.

Digital Library

[6]

Y. Chu, S. G. Rao, and H. Zhang. A Case for End System Multicast. In Proceedings of ACM SIGMETRICS, pages 1--12. ACM Press, 2000.

Digital Library

[7]

M. Dubois, C. Scheurich, and F. A. Briggs. Synchronization, Coherence, and Event Ordering in Multiprocessors. Computer, 21(2):9--21, 1988.

Digital Library

[8]

J. D. Foley, A. Van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics. Addison-Wesley, 1996.

[9]

C. GauthierDickey, D. Zappala, V. Lo, and J. Marr. Low Latency and Cheat-proof Event Ordering for Peer-to-Peer Games. In ACM NOSSDAV, June 2004.

Digital Library

[10]

Gnutella. http://www.gnutella.com.

[11]

D. R. Jefferson. Virtual time. ACM Trans. Program. Lang. Syst., 7(3):404--425, 1985.

Digital Library

[12]

I. Keidar and S. Rajsbaum. On the cost of fault-tolerant consensus when there are no faults---a tutorial. {MIT-LCS-TR-821. Technical Report MIT-LCS-TR-821, MIT, Massachusetts Institute of Technology, Cambridge, MA, 02139, May 2001.

[13]

B. Knutsson, H. Lu, W. Xu, and B. Hopkins. Peer-to-Peer Support for Massively Multiplayer Games. In IEEE Infocom, March 2004.

[14]

L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558--565, 1978.

Digital Library

[15]

L. Lamport. The Part-Time Parliament. ACM Trans. on Comp. Syst., 16(2):133--169, May 1998.

Digital Library

[16]

N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1996.

Digital Library

[17]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In ACM SIGCOMM, pages 161--172. ACM Press, 2001.

Digital Library

[18]

S. Ratnasamy, M. Handley, R. Karp, and S. Shenkar. Application-level multicast using content addressable networks. In Network Group Communications, November 2001.

Digital Library

[19]

A. I. T. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, pages 329--350. Springer-Verlag, 2001.

Digital Library

[20]

J. Smed, T. Kaukoranta, and H. Hakonen. Aspects of networking in multiplayer computer games. In Proceedings of NetGames., April 2002.

[21]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, pages 149--160. ACM Press, 2001.

Digital Library

[22]

B. Zhang, S. Jamin, and L. Zhang. Host multicast: A framework for delivering multicast to end users. In Proceedings of IEEE Infocom, June 2002.

[23]

S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In ACM NOSSDAV, June 2001.

Digital Library

Cited By

Naik AKeshavamurthy B(2019)Next level peer-to-peer overlay networks under high churns: a surveyPeer-to-Peer Networking and Applications10.1007/s12083-019-00839-8Online publication date: 21-Dec-2019
https://doi.org/10.1007/s12083-019-00839-8
Abdulazeez SEl Rhalibi AAl-Jumeily D(2016)Evaluation of scalability and communication in MMOGs2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)10.1109/CCNC.2016.7444812(393-398)Online publication date: Jan-2016
https://doi.org/10.1109/CCNC.2016.7444812
Liu LJones AAntonopoulos NDing ZZhan Y(2015)Performance evaluation and simulation of peer-to-peer protocols for Massively Multiplayer Online GamesMultimedia Tools and Applications10.1007/s11042-013-1662-y74:8(2763-2780)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s11042-013-1662-y
Show More Cited By

Index Terms

Using n-trees for scalable event ordering in peer-to-peer games
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Recommendations

Adaptive event dissemination for peer-to-peer multiplayer online games
SIMUTools '11: Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques

In this paper we show that gossip algorithms may be effectively used to disseminate game events in Peer-to-Peer (P2P) Multiplayer Online Games (MOGs). Game events are disseminated through an overlay network. The proposed scheme exploits the typical ...
Peer-to-peer multimedia applications
MM '06: Proceedings of the 14th ACM international conference on Multimedia

In both academia and industry, peer-to-peer (P2P) applications have attracted great attention. Peer-to-peer file sharing applications, such as Napster, Gnutella, Kazaa, BitTorrent, Skype and PPLive, have witnessed tremendous success among end users. And ...
Understanding churn in peer-to-peer networks
IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requires precise and unbiased information about the arrival and departure of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

NOSSDAV '05: Proceedings of the international workshop on Network and operating systems support for digital audio and video

June 2005

210 pages

ISBN:158113987X

DOI:10.1145/1065983

Program Chairs:
Wu-chi Feng
Portland State University
,
Ketan Mayer-Patel
University of North Carolina

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

NOSSDAV05

Sponsor:

NOSSDAV05: The 15th International Workshop on Network and Operating Systems Support for Digital Audio and Video

June 13 - 14, 2005

Washington, Stevenson, USA

Acceptance Rates

Overall Acceptance Rate 118 of 363 submissions, 33%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
546
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Naik AKeshavamurthy B(2019)Next level peer-to-peer overlay networks under high churns: a surveyPeer-to-Peer Networking and Applications10.1007/s12083-019-00839-8Online publication date: 21-Dec-2019
https://doi.org/10.1007/s12083-019-00839-8
Abdulazeez SEl Rhalibi AAl-Jumeily D(2016)Evaluation of scalability and communication in MMOGs2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC)10.1109/CCNC.2016.7444812(393-398)Online publication date: Jan-2016
https://doi.org/10.1109/CCNC.2016.7444812
Liu LJones AAntonopoulos NDing ZZhan Y(2015)Performance evaluation and simulation of peer-to-peer protocols for Massively Multiplayer Online GamesMultimedia Tools and Applications10.1007/s11042-013-1662-y74:8(2763-2780)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s11042-013-1662-y
Najaran MHu SHutchinson NZimmermann R(2014)SPEXProceedings of the 5th ACM Multimedia Systems Conference10.1145/2557642.2557655(127-138)Online publication date: 19-Mar-2014
https://dl.acm.org/doi/10.1145/2557642.2557655
Yahyavi AKemme B(2013)Peer-to-peer architectures for massively multiplayer online gamesACM Computing Surveys10.1145/2522968.252297746:1(1-51)Online publication date: 11-Jul-2013
https://dl.acm.org/doi/10.1145/2522968.2522977
Mutschler CPhilippsen M(2013)Distributed Low-Latency Out-of-Order Event Processing for High Data Rate Sensor StreamsProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2013.29(1133-1144)Online publication date: 20-May-2013
https://dl.acm.org/doi/10.1109/IPDPS.2013.29
Furness JKolberg MFayed M(2013)An Evaluation of Chord and Pastry Models in OverSimProceedings of the 2013 European Modelling Symposium10.1109/EMS.2013.85(509-513)Online publication date: 20-Nov-2013
https://dl.acm.org/doi/10.1109/EMS.2013.85
Buyukkaya EAbdallah MSimon G(2013)A survey of peer-to-peer overlay approaches for networked virtual environmentsPeer-to-Peer Networking and Applications10.1007/s12083-013-0231-58:2(276-300)Online publication date: 22-Sep-2013
https://doi.org/10.1007/s12083-013-0231-5
Jones ALiu LAntonopoulos NLiu W(2012)An Analysis of Peer to Peer Protocols for Massively Multiplayer Online GamesProceedings of the 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications10.1109/TrustCom.2012.69(1994-1999)Online publication date: 25-Jun-2012
https://dl.acm.org/doi/10.1109/TrustCom.2012.69
Susilo WChow YWiangsripanawan R(2012)Towards formalizing a reputation system for cheating detection in peer-to-peer-based massively multiplayer online gamesProceedings of the 6th international conference on Network and System Security10.1007/978-3-642-34601-9_22(291-304)Online publication date: 21-Nov-2012
https://dl.acm.org/doi/10.1007/978-3-642-34601-9_22
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten