基于P2P架构的分布式虚拟环境中一种状态消息的随机分发方法

李涛; 胡华; 胡海洋

doi:10.3969/j.issn.1000-0801.2014.10.013

您当前的位置：

首页 >

文章列表页 >

基于P2P架构的分布式虚拟环境中一种状态消息的随机分发方法

研究与开发 | 更新时间：2024-06-05

- 基于P2P架构的分布式虚拟环境中一种状态消息的随机分发方法
- Random Dissemination Algorithm of Stete-Updating Message for Distributed Virtual Environments of P2P Architecture
- 电信科学 2014年30卷第10期页码：78-88
- 作者机构：
  
  1. 杭州电子科技大学计算机学院杭州 310018
  2. 杭州电子科技大学复杂系统建摸与仿真教育部重点实验室杭州 310018
  3. 南京大学软件新技术国家重点实验室南京 210093
  1.1．杭州电子科技大学计算机学院杭州 310018;2．杭州电子科技大学复杂系统建摸与仿真教育部重点实验室杭州 310018;3．南京大学软件新技术国家重点实验室南京 210093
- 作者简介：
  
  [ "李涛，男，杭州电子科技大学硕士生，主要研究方向为分布式系统。" ]
  [ "胡华，男，博士，杭州电子科技大学教授，主要研究方向为分布式系统、数据库技术。" ]
  [ "胡海洋，男，博士，杭州电子科技大学教授，主要研究方向为分布式系统、工作流技术。" ]
- 基金信息：
  
  国家自然科学基金资助项目(60903053;61272188);浙江省自然科学基金资助项目(LY12F02005);南京大学计算机软件新技术国家重点实验室开放基金资助项目;The Foundation of State Key Laboratory for Novel Software Technology of Nanjing University(KFKT2014B15)
- DOI：10.3969/j.issn.1000-0801.2014.10.013
  中图分类号：
- 网络出版日期：2014-10，
  
  纸质出版日期：2014-10-20
- 稿件说明：
移动端阅览
李涛, 胡华, 胡海洋. 基于P2P架构的分布式虚拟环境中一种状态消息的随机分发方法[J]. 电信科学, 2014,30(10):78-88.

Tao Li, Hua Hu, Haiyang Hu. Random Dissemination Algorithm of Stete-Updating Message for Distributed Virtual Environments of P2P Architecture[J]. Telecommunications science, 2014, 30(10): 78-88.
李涛, 胡华, 胡海洋. 基于P2P架构的分布式虚拟环境中一种状态消息的随机分发方法[J]. 电信科学, 2014,30(10):78-88. DOI： 10.3969/j.issn.1000-0801.2014.10.013.

Tao Li, Hua Hu, Haiyang Hu. Random Dissemination Algorithm of Stete-Updating Message for Distributed Virtual Environments of P2P Architecture[J]. Telecommunications science, 2014, 30(10): 78-88. DOI： 10.3969/j.issn.1000-0801.2014.10.013.

摘要

针对基于P2P通信架构的分布式虚拟环境中的视图一致性问题，在分析有限的网络带宽等影响因素的基础上，提出了一种随机广播算法进行状态消息分发。该算法需预先建立随机几何图结构，并利用给出的通信限制时延进行状态更新消息的发送。结合基于贪心的路由选择算法，通过已获得状态更新消息的节点转发，进而确定节点间的转发路由，获得节点间具有较少通信时延的消息传播时间。经实验分析及验证表明，该算法与其他几种算法相比较而言，在很大程度上减少了时空不一致性事件率，提高了系统性能。

Abstract

With the aim at optimizing view consistency in P2P distributed virtual environments

a random broadcasting algorithm for distributing state-updating message among users was proposed. By considering the limited network bandwidth and communication delay

which may affect the users' sensing of the real-life experience and the real-time interaction for the participants

the method was given based on the pre-established random geometric graph to distribute the state-updating messages. The greedy routing algorithm can find the forwarding route and obtain the message-spreading time between the source and the destinations. By compared with several other algorithms

the experiment results show that the random broadcast algorithm can reduce the event rates of the time-space inconsistency and improve the system performance.

关键词

Keywords

references

Stytz M R ． Distributed virtual environments . IEEE Computer Graphics and Applications , 1996 , 16 ( 3 ): 19 ～ 31

Matsumoto N , Kawahara Y , Hiroyuki Morikawa . A scalable and low delay communication scheme for networked virtual environments . Proceedings of IEEE Global Telecommunications Conference Workshops 2004 , Dallas, Texas, USA , 2004 : 529 ～ 535

Li Y S , Cai W T . Consistency-aware partitioning algorithm in multi-server distributed virtual environments . Proceedings of the 26th International Parallel＆Distributed Processing Symposium （IPDPS） , Shanghai, China , 2012 : 798 ～ 807

Li Y S , Cai W T . Update schedules for improving consistency in multi-server distributed virtual environments . Journal of Network and Computer Applications , 2014 , 41 ( 5 ): 263 ～ 273

Hu S Y , Chen J F , Chen T H . Von:a scalable peer-to-peer network for virtual environments . IEEE Network , 2006 , 20 ( 4 ): 22 ～ 31

Buyukkaya E , Abdallah M . VoroGame: a hybrid P2P architecture for massively multiplayer games . Proceedings of Consumer Communications and Networking Conference , Las Vegas,NV , 2009

Gilmore J S , Engelbrecht H A . A survey of state persistency in peer-to-peer massively multiplayer online games . Parallel and Distributed Systems , 2012 , 23 ( 5 ): 818 ～ 834

Lui J C S . Constructing communication subgraphs and deriving an optimal synchronization interval for distributed virtual environment systems . Knowledge and Data Engineering , 2001 , 13 ( 5 ): 778 ～ 792

Hanawa D , Yonekura T . A proposal of dead reckoning protocol in distributed virtual environment based on the taylor expansion . Proceedings of Cyberworlds International Conference , Lausanne, Switzerland , 2006

Jiang Jehn-Ruey , Huang Yuli . Scalable AOI-cast for peer-to-peer networked virtual environments . Proceedings of the 28th International Conference Distributed Computing Systems Workshops（ICDCS'08） , Beijing, China , 2008

Albano M , Genovali L , Quartulli A , et al ． AOI cast by tolerance based compass routing in distributed virtual environments . Proceedings of Network and Systems Support for Games （NetGames） , Paris, France , 2009

Zhou S P , Lee Bu-Sung , Turner S J , et al ． Time-space consistency in large-scale distributed virtual environments . Proceedings of ACM Transactions on Modeling and Computer Simulation , New York, USA , 2004

Bradonjic M , Elsässer R , Friedrich T , et al ． Efficient broadcast on random geometric graphs . Proceedings of the ACM-SIAM Symposium on Discrete Algorithms（SODA 2010） , PA,USA , 2010

Penrose M . Random Geometric Graphs . Oxford Univ Press , 2003

Weigend A S , Huberman B A , Rumelhart D E . Predicting the future: a connectionist approach . International Journal of Neural Systems , 1990 , 1 ( 3 )

Roberts D , Marshall D , Aspin R , et al ． Exploring the use of local consistency measures as thresholds for dead reckoning update packet generation . Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications（DS-RT'05） , Montreal, Canada , 2005

Tang X Y , Zhou S P . Update scheduling for improving consistency in distributed virtual environments . Parallel and Distributed Systems , 2010 , 21 ( 6 ): 765 ～ 777

Hu S Y , Chang S C , Jiang J R . Voronoi state management for peer-to-peer massively multiplayer online games . Proceedings of Consumer Communications and Networking Conference , Las Vegas, USA , 2008

Dickey C G , Lo V , Zappala D . Using n-trees for scalable event ordering in peer-to-peer games . Proceedings of the International Workshop on Network and Operating Systems Support for Digital Audio and Video , New York, USA , 2005 : 87 ～ 92

Ahmed D T , Shirmohammadi S . A dynamic area of interest management and collaboration model for P2P MMOGs . Proceedings of 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications , Vancouver, BC, Canada , 2008 : 27 ～ 34 .

Stoica I , Morris R , Karger D , et al . Chord: a scalable peer-to-peer lookup service for Internet applications . Proceedings of the 2001 SIGCOMM Conference , New York, USA , 2001

浏览量

298

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据