通过P2P八卦减少MMOG中的服务器负载

E. Carlini, L. Ricci, M. Coppola
{"title":"通过P2P八卦减少MMOG中的服务器负载","authors":"E. Carlini, L. Ricci, M. Coppola","doi":"10.1109/NetGames.2012.6404015","DOIUrl":null,"url":null,"abstract":"A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, i.e. determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a centralized entity.","PeriodicalId":279768,"journal":{"name":"2012 11th Annual Workshop on Network and Systems Support for Games (NetGames)","volume":"67 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Reducing Server Load in MMOG via P2P Gossip\",\"authors\":\"E. Carlini, L. Ricci, M. Coppola\",\"doi\":\"10.1109/NetGames.2012.6404015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, i.e. determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a centralized entity.\",\"PeriodicalId\":279768,\"journal\":{\"name\":\"2012 11th Annual Workshop on Network and Systems Support for Games (NetGames)\",\"volume\":\"67 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 11th Annual Workshop on Network and Systems Support for Games (NetGames)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NetGames.2012.6404015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th Annual Workshop on Network and Systems Support for Games (NetGames)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NetGames.2012.6404015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

大型多人在线游戏(mmog)开发的一个基本问题是支持兴趣管理的机制的定义,即决定虚拟世界中与给定同伴相关的所有实体。为此,我们提出了一种将集中式和P2P解决方案相结合的混合架构。我们的提案利用了基于P2P八卦的方法来支持利益管理的最佳解决方案,因此它可以通过P2P覆盖得到最大程度的支持,而中央实体的干预最少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reducing Server Load in MMOG via P2P Gossip
A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, i.e. determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a centralized entity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信