Integrating centralized and peer‐to‐peer architectures to support interest management in massively multiplayer on‐line games. (19th May 2014)

• Record Type: Journal Article
• Authors: Carlini, Emanuele; Ricci, Laura; Coppola, Massimo; Limet, Sébastien; Smari, Waleed W.; Spalazzi, Luca; Hu, Jia; Gao, Jianliang
• Is Part Of: Concurrency and computation. Volume 27:Number 13(2015:Sep.)
• Page Start: 3362
• Page End: 3382
• Publication Date: 2014-05-19
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3289
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3289-abs-0001"> <title>Summary</title> <p id="cpe3289-para-0001">A fundamental problem for the development of peer‐to‐peer (P2P) distributed virtual environments, like massively multiplayer on‐line games, is the definition of an overlay supporting interest management, that is, determining all the entities of the virtual world that are relevant for a given player. To this end, this paper proposes a gossip‐based approach that considers the coverage of the area of interest of peers as the guiding principle for the definition of the P2P overlay and its maintenance. The resulting overlay provides a support for a best‐effort resolution of interest management, mostly supported through communications on the P2P overlay, with minimal intervention of a centralized entity. The paper presents a set of extensive simulations based on realistic mobility traces. The experimental results show the effectiveness of gossiping for the construction and maintenance of a best‐effort overlay for interest management. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>