Challenges in peer-to-peer gaming

Neumann, Christoph; Prigent, Nicolas; Varvello, Matteo; Suh, Kyoungwon

doi:10.1145/1198255.1198269

Cited by 32 publications

(23 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Indeed, as even more players join, the onus is on the system to keep providing more and more expensive server resources. Thus, we see the scalability issues inherent in CS [5], [6].…”

Section: A Problem Statementmentioning

confidence: 99%

“…There are alternative techniques that try to resolve gameplay decisions using multiple referees. However, considering that players may easily cheat by modifying outgoing packets [6], [14], there is almost always a dispute on outcomes. Thus, it may very well boil down to a single deciding peer, which weakens the case for group voting mechanisms such as [15]- [17].…”

Section: Role Of Arbitratorsmentioning

confidence: 99%

See 1 more Smart Citation

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

Almashor

Khalil

Tari

et al. 2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

The very notion of a fully Peer-to-Peer (P2P) Virtual Environment (VE) places exacting demands on its underlying network. Subset applications such as online games are notorious for their sensitivity to latency and high bandwidth demands. By omitting the centralised mechanisms that underpin current commercial implementations, the task of managing a disparate and dynamic peer population is made ever more daunting.For any VE, arbitrating the interactions between players is an inescapable need. Online games are equal parts collaboration and competition, requiring robust conflict resolution mechanisms to govern game-play. With centralised systems, arbitration duties are simply assigned to a provisioned server infrastructure. In a P2P system however, the issue looms large. As such, managing arbitration loads across the peer population is the focus here. Being a game-play arbitrator entails added bandwidth and processing demands. Thus, great care is needed to avoid overloading peers whilst providing a responsive and uninterrupted experience.The work here exploits 3D Voronoi Diagrams (3D-VD) as a scalable, flexible and fault-tolerant P2P overlay that is able to automatically balance arbitration loads amongst peers. Simulation results indicate how 3D-VD, with the right arbitrator-selection policy, can appropriately distribute loads and reduce load fluctuations by up to 90%. This is then augmented with algorithms based on classical Newtonian gravity laws. Doing so provides an autonomous method to detect and respond to high-demand areas within the VE. Further experimentation demonstrates an ability to reduce the instances of failed arbitration attempts by 50%.Index Terms-Peer-to-peer overlays, distributed virtual environments, load management.

show abstract

“…Indeed, as even more players join, the onus is on the system to keep providing more and more expensive server resources. Thus, we see the scalability issues inherent in CS [5], [6].…”

Section: A Problem Statementmentioning

confidence: 99%

Section: Role Of Arbitratorsmentioning

confidence: 99%

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

Almashor

Khalil

Tari

et al. 2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…Security, which includes cheating mitigation, has been identified as a major issue for P2P networks [66], [82], [47]. The challenges reside in the fact that peers are not under the control of the operator.…”

Section: Securitymentioning

confidence: 99%

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

“…Multiplayer Online Games (MOG) are a major subset of such Distributed VEs (DVE) and at present, are still built on classical client-server (CS) principles. While relatively easier to engineer and manage, CS architectures lack the much desired characteristics of P2P systems [3], [4]. The works of [5], [6] have brought us closer to actualizing a P2P-VE but many challenges remain.…”

Section: Introductionmentioning

confidence: 99%

Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-Peer Virtual Environments

Almashor

Khalil

2010

2010 IEEE 16th International Conference on Parallel and Distributed Systems

View full text Add to dashboard Cite

Balancing communication workloads is a perennial performance issue in the area of Distributed Virtual Environments (DVE). The stringent time constraints of Multiplayer Online Games (MOG) complicate efforts to effectively distribute the networking load amongst servers. This issue becomes ever more exacting, when we move towards a fully Peer-to-peer virtual world (P2P-VE). We are consequently forced to factor in the limited capabilities of ordinary peers in the network. Traditional MOGs have been built on the client-server (CS) paradigm and the industry brute-force approach of over-provisioning resources is both inelegant and non-resilient in the face of failures. Moving such systems onto P2P architectures mitigates these drawbacks significantly. Our recent application of three-dimensional Voronoi Diagrams (3D-VD) onto P2P-VEs has further introduced desirable load-balancing properties in such systems. This is due to the novel use network capacity as the metric for the 3rd dimension and the subsequent use of the 3D-VD to intelligently appoint dynamic game-play arbitrators from amongst the peer population. This short paper is a preliminary report on the load-balancing properties seen in our extensive simulations. It is shown how this approach is able to appropriately distribute load in a variety of network configurations and peer populations. Thus, the performance of the collaborating peers is enhanced, ultimately leading to better game-play experience.

show abstract

Challenges in peer-to-peer gaming

Cited by 32 publications

References 11 publications

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

Automatic and Autonomous Load Management in Peer-to-Peer Virtual Environments

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

Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-Peer Virtual Environments

Contact Info

Product

Resources

About