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

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 sco...More