The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Masaki KOHANA(2hit)

1-2hit
  • Evaluation of a Dynamic Data Allocation Method for Web-Based Multi-Server MORPG System

    Masaki KOHANA  Shusuke OKAMOTO  Masaru KAMADA  Tatsuhiro YONEKURA  

     
    PAPER

      Vol:
    E93-D No:12
      Page(s):
    3173-3180

    We 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.

  • A Meta-Heuristic Approach for Dynamic Data Allocation on a Multiple Web Server System

    Masaki KOHANA  Shusuke OKAMOTO  Atsuko IKEGAMI  

     
    PAPER

      Vol:
    E96-D No:12
      Page(s):
    2645-2653

    This paper describes a near-optimal allocation method for web-based multi-player online role-playing games (MORPGs), which must be able to cope with a large number of users and high frequency of user requests. Our previous work introduced a dynamic data reallocation method. It uses multiple web servers and divides the entire game world into small blocks. Each ownership of block is allocated to a web server. Additionally, the ownership is reallocated to the other web server according to the user's requests. Furthermore, this block allocation was formulated as a combinational optimization problem. And a simulation based experiment with an exact algorithm showed that our system could achieve 31% better than an ad-hoc approach. However, the exact algorithm takes too much time to solve a problem when the problem size is large. This paper proposes a meta-heuristic approach based on a tabu search to solve a problem quickly. A simulation result shows that our tabu search algorithm can generate solutions, whose average correctness is only 1% different from that of the exact algorithm. In addition, the average calculation time for 50 users on a system with five web servers is about 25.67 msec while the exact algorithm takes about 162 msec. An evaluation for a web-based MORPG system with our tabu search shows that it could achieve 420 users capacity while 320 for our previous system.