Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John S. Gilmore

dblp:66/11150 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 72% Storage systems · 28%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
distributed storage
0.112012
A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games · IEEE Trans. Parallel Distributed Syst. 2012
Distributed systems
peer-to-peer systems
0.112012
A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games · IEEE Trans. Parallel Distributed Syst. 2012
Distributed systems › state management
state persistence
0.112012
A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games · IEEE Trans. Parallel Distributed Syst. 2012
Distributed systems
consistency models
0.012012
A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games · IEEE Trans. Parallel Distributed Syst. 2012
Distributed systems › consistency models
state consistency
0.012012
A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games · IEEE Trans. Parallel Distributed Syst. 2012

Methods — techniques the papers use, named apart from their topics

survey · 0.1classification of storage techniques · 0.1
YearPublicationVenuePosition
2017 Pithos: Distributed Storage for Massive Multi-User Virtual Environments
abstract
There has been significant research effort into peer-to-peer (P2P) massively multi-user virtual environments (MMVEs). A number of architectures have been proposed to implement the P2P approach; however, the development of fully distributed MMVEs has met with a number of challenges. In this work, we address one of the key remaining challenges of state consistency and persistency in P2P MMVEs. Having reviewed state management and persistency architectures currently receiving research attention, we have identified deficiencies such as lack of load balancing, responsiveness, and scalability. To address these deficiencies, we present Pithos—a reliable, responsive, secure, load-balanced, and scalable distributed storage system, suited to P2P MMVEs. Pithos is designed specifically for P2P MMVEs, and we show that it improves the reliability and responsiveness of storage architectures as compared to existing P2P state persistency architectures. Pithos is implemented as an OverSim simulation running on the OMNeT++ network simulation framework. It is evaluated using up to 10,400 peers, with realistic latency profiles, with up to 15.8 million storage and retrieval requests that are generated to store a total of 2.4 million objects. Each peer in Pithos uses a maximum of 1,950Bps bandwidth to achieve 99.98% storage reliability, while the most reliable overlay storage configuration tested only achieved 93.65% reliability, using 2,182Bps bandwidth. Pithos is also more responsive than overlay storage, with an average responsiveness of 0.192s, compared with the average overlay responsiveness of 1.4s when retrieving objects from storage.
Herman Arnold Engelbrecht, John S. Gilmore
ACM Trans. Multim. Comput. Commun. Appl.2
2012 A Survey of State Persistency in Peer-to-Peer Massively Multiplayer Online Games
abstract
Recently, there has been significant research focus on Peer-to-Peer (P2P) Massively Multiplayer Online Games (MMOGs). A number of architectures have been presented in the literature to implement the P2P approach. One aspect that has not received sufficient attention in these architectures is state persistency in P2P MMOGs. This survey presents an overview of the current challenges present in P2P MMOGs, followed by an overview of classic state consistency models used in C/S MMOGs. The survey then classifies the state persistency techniques currently used in P2P MMOGs into super peer storage, overlay storage, hybrid storage, and distance-based storage. Key characteristics, namely scalability, fairness, reliability, responsiveness, and security are then defined. Each state persistency technique is evaluated according to these characteristics and recommendations are then made of possible future areas of research into the different storage types.
John S. Gilmore, Herman Arnold Engelbrecht
IEEE Trans. Parallel Distributed Syst.1