Share Email Print
cover

Proceedings Paper

Tree-based server-middleman-client architecture: improving scalability and reliability for voting-based network games in ad hoc wireless networks
Author(s): Y. Guo; H. Fujinoki
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 2 October 2006
PDF: 11 pages
Proc. SPIE 6391, Multimedia Systems and Applications IX, 63910I (2 October 2006); doi: 10.1117/12.686527
Show Author Affiliations
Y. Guo, Southern Illinois Univ., Edwardsville (United States)
H. Fujinoki, Southern Illinois Univ., Edwardsville (United States)


Published in SPIE Proceedings Vol. 6391:
Multimedia Systems and Applications IX
Susanto Rahardja; JongWon Kim; Qi Tian; Chang Wen Chen, Editor(s)

© SPIE. Terms of Use
Back to Top