No abstract

In recent times, the web-based applications has grown rapidly and there has been an explosive increase in the number of users. Hence, it is necessary to develop technique to deal with several users. In this study, we particularly focus on web-based multiplayer online role-playing games (MORPGs), which have a large number of users and deal with high frequency of user requests. In our previous work, we introduced a method to deal with a large number of users using multiple web servers and a dynamic data allocation method to deal with dynamic change in the user request. Using our method, we achieved a user capacity of 320 for the web-based MORPG system as opposed to 200 user capacity of the single server MORPG system. However, we found some cases in which our dynamic data allocation role was not effective. In this paper, we propose three rules for our dynamic data allocation method to address various situations. We evaluate these rules using four web servers and investigate their properties and effectiveness.

No abstract

SUMMARYWe have investigated the bottleneck in web-based MORPG system and proposed a load-distribution method using multiple web servers. This technique uses a dynamic data allocation method, called the moving home. This paper describes the evaluation of our method using 4, 8, 16 web servers. We evaluated it on both the single-server system and multi-server system. And we confirm that the effect of the moving home through the comparison between the multi-server system without the moving home and that with the moving home. Our experimental result shows that the upper bound of the number of avatars in the eight-server system with the moving home becomes 380 by contrast that in the single-server system is 200. key words: web-based application, dynamic data allocation, load distribution

No abstract