A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games

Gilmore, John S.; Engelbrecht, Herman A.

doi:10.1109/tpds.2011.210

Cited by 27 publications

(14 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pithos is a hierarchical distributed storage system that uses grouping to reduce latencies of store and retrieve requests, as is required by MMVEs [5].…”

Section: Comparison With Pithosmentioning

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

Self Cite

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

“…Pithos is a hierarchical distributed storage system that uses grouping to reduce latencies of store and retrieve requests, as is required by MMVEs [5].…”

Section: Comparison With Pithosmentioning

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

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is assumed that such an approach will alleviate the security and reliability challenges present in distance-based storage [51].…”

Section: Distance-based Storage Mechanismmentioning

confidence: 99%

“…Although a lack of a thorough comparison of different storage systems in literature made it difficult to empirically compare the existing storage systems, it was found that none of the storage systems satisfy all identified requirements [51]. We therefore developed our novel state management and persistency architecture, to fulfil all the previously identified requirements [50].…”

Section: State Management and Persistencymentioning

confidence: 99%

See 1 more Smart Citation

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

Gilmore¹

2013

SIGMultimedia Rec.

View full text Add to dashboard Cite

“…Although peer-to-peer architectures provide considerable support for scalability of MMOGs and other advantages over traditional client-server games, they still have to face a few key challenges [11,12]. Security is probably the most important one of these challenges, which is caused by the fact that players' communications are out of control of the server.…”

Section: Introductionmentioning

confidence: 99%

A more efficient secure event signature protocol for massively multiplayer online games based on P2P

Li¹,

Liang²,

Chu³

2017

Proceedings of the 2016 International Forum on Mechanical, Control and Automation (IFMCA 2016)

View full text Add to dashboard Cite

Abstract. In recent years, Massively multiplayer online games (MMOGs) have been increasingly popular. Considering the limits of the traditional architectures, MMOGs based on the peer-to-peer networks have many advantages: scalability, computation cost, reliability and concurrency. Researchers have made improvements on this protocol to enhance its security since Chan et al.proposed an efficient and secure event signature (EASES) protocol, however, no one has solved this problem in essence. In 2013, Yuan et al. presented a higher secure scheme, unfortunately, its efficiency is lower than others due to bilinear pairing. In this paper, we propose a more efficient and secure protocol, the security of which is just guaranteed by the Diffie-Hellman problem. Meanwhile, it is concluded that the efficiency of ours also behaves better after the comparison with other existing protocols.

show abstract

A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games

Cited by 27 publications

References 47 publications

Predicting object lifetimes in finite distributed storage systems under churn

Predicting object lifetimes in finite distributed storage systems under churn

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

A more efficient secure event signature protocol for massively multiplayer online games based on P2P

Contact Info

Product

Resources

About