On mitigating network partitioning in peer-to-peer massively multiplayer games

Authors:
Yuan He;Yi Zhang;Jiang Guo
Affiliations:
Laboratory for Internet Software Technologies, Institute of Software, The Chinese Academy of Sciences, Beijing, China;Laboratory for Internet Software Technologies, Institute of Software, The Chinese Academy of Sciences, Beijing, China;Department of Electrical and Computer Engineering, University of Toronto, Ontario, Canada
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 2
Cited 1

Security Considerations for Peer-to-Peer Distributed Hash Tables

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg

A scalable architecture for massive multi-player online games using peer-to-peer overlay

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, peer-to-peer infrastructure has been proposed to support massively multiplayer games in the literature. However, when underlying network partitions due to network outages, the game world will partition into several parallel game worlds and it is difficult and costly to merge them when the network partitions disappear. Existing approaches resort to a centralized server to arbitrate. Aiming at mitigating the effects brought by network partitions, we propose a fully distributed algorithm based on state-stack matching. Our theoretical analysis and numerical results show that our approach can resolve the merging issue at the least loss of game states with high probability.