A state management and persistency architecture for peer-to-peer massively multi-user virtual environments

Gilmore, John S.

doi:10.1145/2484912.2484917

Cited by 4 publications

(3 citation statements)

References 75 publications

(114 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The bucket synchronization algorithm [6][7] was proposed by C.Diot and L.Gautier, which was first used in multiplayer online games MiMaze for DIS-based simulation based on serverless P2P architectures. In this paper, some of the ideas of bucket synchronization algorithm are borrowed, and the synchronization algorithm of frame bucket locking is proposed based on the idea of online game synchronization.…”

Section: A Frame Bucket Synchronization Algorithmmentioning

confidence: 99%

Research on Dynamic Synchronization of Multi Channel Three Dimensional Visual Simulation System

Yao¹,

Chen²,

Yuan³

et al. 2017

Proceedings of the 2017 International Conference on Information Technology and Intelligent Manufacturing (ITIM 2017)

View full text Add to dashboard Cite

Abstract-In order to guarantee the synchronization of multi-simulation entities in the multi-channel 3D visual simulation system, the dynamic synchronization method is of great significance. By improving the traditional bucket synchronization algorithm, the paper presents and implements the frame bucket lock synchronization algorithm, which effectively solves the problem of image ghosting and tearing that may occur when the moving entity traverses the critical region of the three-dimensional virtual simulation system of multi-channel ship driving. Ensure the critical channel screen seamless stitching. By introducing the RakNet network engine to ensure the reliability of data transmission, a motion smoothing algorithm with cubic spline interpolation is proposed, and an effective method to deal with the smoothing of the ship is given. The experimental results show that the proposed algorithm is feasible and feasible to solve the multi -channel synchronization problem of multiathletic entities in three -dimensional ship driving virtual machine, and the display effect is better.

show abstract

Section: A Frame Bucket Synchronization Algorithmmentioning

confidence: 99%

Research on Dynamic Synchronization of Multi Channel Three Dimensional Visual Simulation System

Yao¹,

Chen²,

Yuan³

et al. 2017

Proceedings of the 2017 International Conference on Information Technology and Intelligent Manufacturing (ITIM 2017)

View full text Add to dashboard Cite

show abstract

“…For example, [31] presents a two-fold approach for state management in P2P virtual environments where a structured overlay is used for object state management and a triangulation overlay is used for avatar state and group membership management. [32] presents a state management and persistency architecture for P2P virtual environments called Pithos, which is a group-based distance-oriented method that covers both responsive storage system and the security aspects of scalable distributed storage. While the above approaches lead to good results, they are not optimized for our specific case of Delaunay-based P2P overlays.…”

Section: A Connection To Nodes Responsible For Objects In Area Of Effectmentioning

confidence: 99%

A Dynamic Networking Substrate for Distributed MMOGs

Ghaffari

Hariri

Shirmohammadi

et al. 2015

IEEE Trans. Emerg. Topics Comput.

View full text Add to dashboard Cite

This paper proposes a distributed and dynamic networking architecture for massively multiplayer online games (MMOGs). The MMOG networks deal with the challenge of update message exchange among a large number of players that are subject to both mobility (constant change of virtual location) and churn (joining and leaving the physical network at will). Ideally, a player's update messages should be multicasted to the player's area of effect, which is a neighborhood around the player. But, this requires the system to have a centralized indexing service that keeps record of players residing in each region, making the system less scalable as the number of players increases. The use of geometric routing helps alleviate this requirement by exploiting location addressing and thus eliminating the need for IP-search queries. However, geometric routing comes with a number of convergence and performance issues that require solutions for reducing hop-count and minimizing overall delay while providing guaranteed message delivery. In this paper, we propose a geometric routing overlay for message exchange among a large number of MMOG players that not only provides reduced delay and guaranteed delivery, but also supports player mobility and churn. In addition, we enhance our greedy routing method to more efficiently support long distance messages. We demonstrate the effectiveness of our proposed scheme using both theory and simulations.

show abstract

“…Our interest in size limited distributed storage network is as a result of Pithos, the hierarchical distributed storage system that we have developed [4,3]. The Pithos network topology is a multi-tiered structured overlay where peers are grouped to form a two-tiered storage model.…”

Section: Introductionmentioning

confidence: 99%

Predicting object lifetimes in finite distributed storage systems under churn

Gilmore

Engelbrecht

2015

Proceedings of the 7th ACM International Workshop on Massively Multiuser Virtual Environments

View full text Add to dashboard Cite

Distributed network storage systems regularly make use of object replication to achieve sufficient levels of reliability under network churn. To maintain reliability, a repair mechanism is employed, which replaces destroyed replicas. When designing a distributed storage system, it is of great benefit to design for objects with known lifetimes. That is to say, the expected time that an object will remain available in the storage network under measurable network conditions is known. The paper proposes an embedded continuous time Markov chain to model objects replicated in a finite network under churn, with repair. Object lifetimes are found to be dependant on node departure and arrival rates, initial network size and the average network size if the average network size is comparable to the required number of replicas. The theoretical model results are compared to an OMNeT++ network simulation and found to closely match.

show abstract

A state management and persistency architecture for peer-to-peer massively multi-user virtual environments

Cited by 4 publications

References 75 publications

Research on Dynamic Synchronization of Multi Channel Three Dimensional Visual Simulation System

Research on Dynamic Synchronization of Multi Channel Three Dimensional Visual Simulation System

A Dynamic Networking Substrate for Distributed MMOGs

Predicting object lifetimes in finite distributed storage systems under churn

Contact Info

Product

Resources

About