The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Nous avons étudié le goulot d'étranglement dans le système MORPG basé sur le Web et proposé une méthode de répartition de la charge utilisant plusieurs serveurs Web. Cette technique utilise une méthode d'allocation dynamique des données, appelée le déménagement. Cet article décrit l'évaluation de notre méthode en utilisant 4, 8, 16 serveurs Web. Nous l'avons évalué à la fois sur le système à serveur unique et sur le système multi-serveur. Et nous confirmons cet effet du déménagement à travers la comparaison entre le système multi-serveurs sans déménagement et celui avec déménagement. Notre résultat expérimental montre que la limite supérieure du nombre d'avatars dans le système à huit serveurs avec déménagement devient 380, alors que dans le système à serveur unique, elle est de 200.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Masaki KOHANA, Shusuke OKAMOTO, Masaru KAMADA, Tatsuhiro YONEKURA, "Evaluation of a Dynamic Data Allocation Method for Web-Based Multi-Server MORPG System" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 12, pp. 3173-3180, December 2010, doi: 10.1587/transinf.E93.D.3173.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.3173/_p
Copier
@ARTICLE{e93-d_12_3173,
author={Masaki KOHANA, Shusuke OKAMOTO, Masaru KAMADA, Tatsuhiro YONEKURA, },
journal={IEICE TRANSACTIONS on Information},
title={Evaluation of a Dynamic Data Allocation Method for Web-Based Multi-Server MORPG System},
year={2010},
volume={E93-D},
number={12},
pages={3173-3180},
abstract={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.},
keywords={},
doi={10.1587/transinf.E93.D.3173},
ISSN={1745-1361},
month={December},}
Copier
TY - JOUR
TI - Evaluation of a Dynamic Data Allocation Method for Web-Based Multi-Server MORPG System
T2 - IEICE TRANSACTIONS on Information
SP - 3173
EP - 3180
AU - Masaki KOHANA
AU - Shusuke OKAMOTO
AU - Masaru KAMADA
AU - Tatsuhiro YONEKURA
PY - 2010
DO - 10.1587/transinf.E93.D.3173
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2010
AB - 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.
ER -