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
Traffic characteristics of a massively multi-player online role playing game
NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Semantic partitioning of peer-to-peer search space
Computer Communications
A peer auditing scheme for cheat elimination in MMOGs
Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games
Hi-index | 0.24 |
Scalability is a critical issue for Massively Multiplayer Online Role Playing Games (MMORPG). To address the scalability drawbacks of current central server model, we present a scenario to support MMORPG through Pastry, a structured peer-to-peer overlay. In order to closely reflect an advanced MMORPG configuration, the scenario considers bandwidth and latency constraints required by the games based on actual MMORPG traffic pattern. A simulation model is developed to evaluate the performance of Pastry in supporting such a scenario. Results show that Pastry performs well in distributing node stress. However, there is a bottleneck in terms of upstream bandwidth usage, which can be removed by low-cost algorithms. Results also show that using Scribe multicast tree built on top of Pastry to disseminate game traffic is an effective way to save bandwidth usage. In addition, Scribe multicast tree scales well in supporting the scenario with respect to the tree length. When a tree size increases five times, the length of the tree only increases less than two levels.