Optimal data allocation and fairness for online games
by Masaki Kohana; Shusuke Okamoto; Atsuko Ikegami
International Journal of Grid and Utility Computing (IJGUC), Vol. 5, No. 3, 2014

Abstract: In our previous work, we proposed a load distribution technique and a dynamic data reallocation method for web-based Multiplayer Online Role-Playing Game (MORPG) systems. Our proposed approach reduced the average server latency for game players. However, latency values varied widely resulting in some game players gaining an advantage over others. In this paper, we deal with data allocation and consider latency fairness in the form of a combinational optimisation problem. We develop an optimisation model in which the objective function minimises the differences in latency values and we solve instances from this model using an exact algorithm. Our model improved latency fairness and more stable server loads than the previous data reallocation method. Furthermore, it provides more stable gameplay using ten web servers instead of five.

Online publication date: Wed, 29-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com