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

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.

DOI: 10.1145/1065983.1066005

Extracted Key Phrases

3 Figures and Tables

Statistics

051015'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{GauthierDickey2005UsingNF, title={Using n-trees for scalable event ordering in peer-to-peer games}, author={Chris GauthierDickey and Virginia Mary Lo and Daniel Zappala}, booktitle={NOSSDAV}, year={2005} }