Reducing server load in MMOG via P2P gossip

Authors:
Emanuele Carlini;Laura Ricci;Massimo Coppola
Affiliations:
IMT Lucca, and CNR-ISTI, Pisa, Italy;University of Pisa, and CNR-ISTI, Pisa, Italy;Institute of Information Science and Technologies CNR-ISTI, Pisa, Italy
Venue:
Proceedings of the 11th Annual Workshop on Network and Systems Support for Games
Year:
2012

Citing 4
Cited 0

Comparing interest management algorithms for massively multiplayer games

NetGames '06 Proceedings of 5th ACM SIGCOMM workshop on Network and system support for games
T-Man: Gossip-based fast overlay topology construction

Computer Networks: The International Journal of Computer and Telecommunications Networking
Nomad: virtual environments on P2P voronoi overlays

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Integration of P2P and clouds to support massively multiuser virtual environments

Proceedings of the 9th Annual Workshop on Network and Systems Support for Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, i.e. determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a centralized entity.