Share Email Print

Proceedings Paper

Adaptive client to mirrored-server assignment for massively multiplayer online games
Author(s): Steven Daniel Webb; Sieteng Soh
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Mirrored Server (MS) architecture for network games uses multiple mirrored servers across multiple locations to alleviate the bandwidth bottleneck and to reduce the client-to-server delay time. Response time in MS can be reduced by optimally assigning clients to their mirrors. The goal of optimal client-to-mirror-assignment (CMA) is to achieve the minimum average client-to-mirror delay considering player joins (CMA-J) and leaves (CMA-L), and mirrors with limited capacity. The existing heuristic solution considers only CMA-J, and thus the average delay of the remaining players may increase when one or more players leave. Furthermore, the solution ignores mirror capacity, which may overload mirrors. In this paper we present a resource usage model for the MS architecture, and formally state the CMA problem. For both CMA-J and CMA-L we propose a polynomial time optimal solution and a faster heuristic algorithm that obtains near optimal CMA. Our simulations on randomly generated MS topologies show that our algorithms significantly reduce the average delay of the existing solution. We also compare the merits of the solutions in terms of their optimality and running time efficiency.

Paper Details

Date Published: 28 January 2008
PDF: 8 pages
Proc. SPIE 6818, Multimedia Computing and Networking 2008, 68180I (28 January 2008); doi: 10.1117/12.775145
Show Author Affiliations
Steven Daniel Webb, Curtin Univ. of Technology (Australia)
Sieteng Soh, Curtin Univ. of Technology (Australia)

Published in SPIE Proceedings Vol. 6818:
Multimedia Computing and Networking 2008
Reza Rejaie; Roger Zimmermann, Editor(s)

© SPIE. Terms of Use
Back to Top