拓扑感知集群,实现与多人在线游戏中一帧相当的延迟

Y. Aikawa, Y. Hei, T. Ogishi, S. Niida, T. Hasegawa
{"title":"拓扑感知集群,实现与多人在线游戏中一帧相当的延迟","authors":"Y. Aikawa, Y. Hei, T. Ogishi, S. Niida, T. Hasegawa","doi":"10.1109/ICC.2013.6654870","DOIUrl":null,"url":null,"abstract":"The market for multiplayer online games is rapidly growing in concert with the growth in broadband Internet connection services. Since such games share a virtual space among many players, it is important to match players to a group so that they share low-latency connections with each other. This is because the latency between them affects the perceived quality of their experience. In this paper, we propose a topology-aware matching algorithm using players' geographical locations. We focus on synchronous multiplayer games that require a latency comparable to a delay of one frame. This paper describes the algorithm and its evaluation by simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"54 1","pages":"2288-2292"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Topology-aware clustering to achieve latency comparable to one-frame in multiplayer online games\",\"authors\":\"Y. Aikawa, Y. Hei, T. Ogishi, S. Niida, T. Hasegawa\",\"doi\":\"10.1109/ICC.2013.6654870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The market for multiplayer online games is rapidly growing in concert with the growth in broadband Internet connection services. Since such games share a virtual space among many players, it is important to match players to a group so that they share low-latency connections with each other. This is because the latency between them affects the perceived quality of their experience. In this paper, we propose a topology-aware matching algorithm using players' geographical locations. We focus on synchronous multiplayer games that require a latency comparable to a delay of one frame. This paper describes the algorithm and its evaluation by simulations.\",\"PeriodicalId\":6368,\"journal\":{\"name\":\"2013 IEEE International Conference on Communications (ICC)\",\"volume\":\"54 1\",\"pages\":\"2288-2292\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2013.6654870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2013.6654870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

随着宽带互联网连接服务的发展,多人在线游戏市场也在迅速增长。由于这类游戏在许多玩家之间共享虚拟空间,因此将玩家匹配到一个组中以便他们彼此共享低延迟连接是很重要的。这是因为它们之间的延迟影响了他们体验的感知质量。在本文中,我们提出了一种基于玩家地理位置的拓扑感知匹配算法。我们专注于同步多人游戏,这类游戏需要一帧左右的延迟。本文介绍了该算法并通过仿真对其进行了评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Topology-aware clustering to achieve latency comparable to one-frame in multiplayer online games
The market for multiplayer online games is rapidly growing in concert with the growth in broadband Internet connection services. Since such games share a virtual space among many players, it is important to match players to a group so that they share low-latency connections with each other. This is because the latency between them affects the perceived quality of their experience. In this paper, we propose a topology-aware matching algorithm using players' geographical locations. We focus on synchronous multiplayer games that require a latency comparable to a delay of one frame. This paper describes the algorithm and its evaluation by simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Signature identification techniques with Zadoff-Chu sequence for OFDM systems Double-talk detection using the singular value decomposition for acoustic echo cancellation Dynamic virtual machine allocation in cloud server facility systems with renewable energy sources Approximate channel block diagonalization for open-loop Multiuser MIMO communications A location-based self-optimizing algorithm for the inter-RAT handover parameters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1