A low-latency peer-to-peer approach for massively multiplayer games

Authors:
Jin Zhou;Li Tang;Kai Li;Hao Wang;Zhizhi Zhou
Affiliations:
University of Tsinghua, Beijing, China;University of Tsinghua, Beijing, China;University of Tsinghua, Beijing, China;University of Tsinghua, Beijing, China;Renmin University of China, Beijing, China
Venue:
AP2PC'05 Proceedings of the 4th international conference on Agents and Peer-to-Peer Computing
Year:
2005

Citing 2
Cited 2

A communication architecture for massive multiplayer games

NetGames '02 Proceedings of the 1st workshop on Network and system support for games
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

FreeRank: implementing independent ranking service for multiplayer online games

NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
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

This paper focuses on the latency reduction problem in massively multiplayer games (MMGs). As the client-server (CS) architecture in use today in most commercial MMGs applications are exposing its weakness in scalability as the number of players increases, researchers start to consider the peer-to-peer (P2P) model that has inherent high scalability for MMGs. However, existing P2P models generally lead to high latency that significantly detracts from the playing experience. To improve this, we present a novel communication model intended to reduce the latency of network communication on game states. The model, based on DHT protocol, can select the best candidate node to perform server's role for a game zone. In contrast, existing P2P models designate 'peer servers' randomly without considering latency effects. The simulation shows that our approach obtains much lower latency than existing P2P models. The performance of our approach is shown to be even better than that of CS models.