Chris GauthierDickey
Daniel Zappala
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.
- S. Banerjee, B. Bhattacharjee, and C. Kommareddy. Scalable application layer multicast. In Proceedings of ACM SIGCOMM, pages 205--217. ACM Press, 2002. Google Scholar
Digital Library
- N. E. Baughman and B. N. Levine.q Cheat-proof Playout for Centralized and Distributed Online Games. In INFOCOM, pages 104--113, 2001.Google ScholarCross Ref
- A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting Scalable Multi-Attribute Range Queries. In Proceedings of ACM SIGCOMM, August 2004. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. Dubois, C. Scheurich, and F. A. Briggs. Synchronization, Coherence, and Event Ordering in Multiprocessors. Computer, 21(2):9--21, 1988. Google ScholarDigital Library
- J. D. Foley, A. Van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics. Addison-Wesley, 1996.Google Scholar
- 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. Google ScholarDigital Library
- Gnutella. http://www.gnutella.com.Google Scholar
- D. R. Jefferson. Virtual time. ACM Trans. Program. Lang. Syst., 7(3):404--425, 1985. Google ScholarDigital Library
- 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.Google Scholar
- B. Knutsson, H. Lu, W. Xu, and B. Hopkins. Peer-to-Peer Support for Massively Multiplayer Games. In IEEE Infocom, March 2004.Google ScholarCross Ref
- L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558--565, 1978. Google ScholarDigital Library
- L. Lamport. The Part-Time Parliament. ACM Trans. on Comp. Syst., 16(2):133--169, May 1998. Google ScholarDigital Library
- N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1996. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- S. Ratnasamy, M. Handley, R. Karp, and S. Shenkar. Application-level multicast using content addressable networks. In Network Group Communications, November 2001. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Smed, T. Kaukoranta, and H. Hakonen. Aspects of networking in multiplayer computer games. In Proceedings of NetGames., April 2002.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- B. Zhang, S. Jamin, and L. Zhang. Host multicast: A framework for delivering multicast to end users. In Proceedings of IEEE Infocom, June 2002.Google Scholar
- 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. Google ScholarDigital Library
Index Terms
- Using n-trees for scalable event ordering in peer-to-peer games
Recommendations
Adaptive event dissemination for peer-to-peer multiplayer online games
SIMUTools '11: Proceedings of the 4th International ICST Conference on Simulation Tools and TechniquesIn 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 MultimediaIn 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 measurementThe 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