Dynamic Data Allocation Scheme for Multi-server Web-Based MORPG System

Kohana, Masaki; Okamoto, Satoru; Kamada, Masaru; Yonekura, Tatsuhiro

doi:10.1109/waina.2010.70

Cited by 10 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our previous work, our system could increase the user capacity by using the moving home method [1]- [3]. However, the latency difference among servers is wide.…”

Section: Modelingmentioning

confidence: 99%

“…It uses LRC rule. With this rule, the block moves to the other server when the block required by only one user [1]- [3]. The single server system is the same configuration as this experiment.…”

Section: Real Systemmentioning

confidence: 99%

“…In our previous work, we proposed a loaddistribution technique for a web-based MORPG using multiple web servers [1]- [3]. This technique divides the entire game world into small blocks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Kohana

Okamoto

Ikegami

2013

IEICE Trans. Inf. & Syst.

Self Cite

View full text Add to dashboard Cite

Masaki KOHANA †a) , Shusuke OKAMOTO †b) , Members, and Atsuko IKEGAMI †c) , Nonmember SUMMARYThis 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. key words: web-based application, dynamic data allocation, tabu search algorithm

show abstract

“…In our previous work, our system could increase the user capacity by using the moving home method [1]- [3]. However, the latency difference among servers is wide.…”

Section: Modelingmentioning

confidence: 99%

Section: Real Systemmentioning

confidence: 99%

See 1 more Smart Citation

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

Kohana

Okamoto

Ikegami

2013

IEICE Trans. Inf. & Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…(5) The threshold T is the value that subtract w s from the load of each server. (6).. (8) are the same as the variable definition.…”

Section: Minimizementioning

confidence: 99%

“…The average latency decreased with this dynamic allocation method. And player capacity of four server system rose up to 320 players in contrast to 200 players of single server system [6][7] [8]. However, the latency difference among servers is not considered.…”

Section: Introductionmentioning

confidence: 99%

Optimal Data Allocation for Keeping Fairness of Online Game

Kohana

Okamoto

Ikegami

2012

2012 26th International Conference on Advanced Information Networking and Applications Workshops

Self Cite

View full text Add to dashboard Cite

In our previous work, we proposed a load distribution technique and dynamic data reallocation method for web-based MORPG system. This approach could reduce the average server latency for game players. However, each latency widely varied, which leads unfair situation for game players. In this paper, we deal with data allocation with taking into account the fairness as a combinational optimization problem. We develop an optimization model whose objective function is to minimize the difference among latency value. We exactly solve this problem and compare the results with our previous data allocation method.

show abstract

Distributed Database Management Systems: Architectural Design Choices for the Cloud

Kamal

Murshed

2014

Computer Communications and Networks

View full text Add to dashboard Cite

Dynamic Data Allocation Scheme for Multi-server Web-Based MORPG System

Cited by 10 publications

References 8 publications

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

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

Optimal Data Allocation for Keeping Fairness of Online Game

Distributed Database Management Systems: Architectural Design Choices for the Cloud

Contact Info

Product

Resources

About