设计DVE中基于时间间隔的公平分区方法

Dongkee Won, B. Kim, Seungjong Chung, D. An
{"title":"设计DVE中基于时间间隔的公平分区方法","authors":"Dongkee Won, B. Kim, Seungjong Chung, D. An","doi":"10.1109/ISITC.2007.39","DOIUrl":null,"url":null,"abstract":"MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars coexisting in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the \"time-interval based fairness partitioning method\" (TIP). TIP will distribute the avatar to the game server equally in order to avoid the problems form the unfairness of game servers load.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Design the Time-Interval Based Fairness Partitioning Method in DVE\",\"authors\":\"Dongkee Won, B. Kim, Seungjong Chung, D. An\",\"doi\":\"10.1109/ISITC.2007.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars coexisting in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the \\\"time-interval based fairness partitioning method\\\" (TIP). TIP will distribute the avatar to the game server equally in order to avoid the problems form the unfairness of game servers load.\",\"PeriodicalId\":394071,\"journal\":{\"name\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITC.2007.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITC.2007.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

mmorpg可能涉及大量并发玩家,这些服务器通常必须管理同一个虚拟世界中共存的数百甚至数千个角色。因此,如果未能发送命令或事件信息,或者发送得太晚,可能会对角色的进化造成损害(死亡、受伤、资源损失),并可能导致玩家受到不合理的惩罚。可以定义许多策略来实现对可用服务器的排名评估。不幸的是,由于服务器负载和网络性能的高度动态特性,任何最优分配很快就会变成次优。为了解决这些问题,我们提出了“基于时间间隔的公平划分方法”(TIP)。TIP将角色平均分配到游戏服务器,以避免游戏服务器负载不公平的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design the Time-Interval Based Fairness Partitioning Method in DVE
MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars coexisting in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the "time-interval based fairness partitioning method" (TIP). TIP will distribute the avatar to the game server equally in order to avoid the problems form the unfairness of game servers load.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信