The concept of a new tree-based architecture for networked multi-player games was proposed by Matuszek to improve
scalability in network traffic at the same time to improve reliability. The architecture (we refer it as "Tree-Based Server-
Middlemen-Client architecture") will solve the two major problems in ad-hoc wireless networks: frequent link failures
and significance in battery power consumption at wireless transceivers by using two new techniques, recursive
aggregation of client messages and subscription-based propagation of game state. However, the performance of the TBSMC
architecture has never been quantitatively studied. In this paper, the TB-SMC architecture is compared with the
client-server architecture using simulation experiments. We developed an event driven simulator to evaluate the
performance of the TB-SMC architecture. In the network traffic scalability experiments, the TB-SMC architecture
resulted in less than 1/14 of the network traffic load for 200 end users. In the reliability experiments, the TB-SMC
architecture improved the number of successfully delivered players' votes by 31.6, 19.0, and 12.4% from the clientserver
architecture at high (failure probability of 90%), moderate (50%) and low (10%) failure probability.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.