A measurement study of virtual populations in massively multiplayer online games

ABSTRACT

Understanding the distributions and behaviors of players within Massively Multiplayer Online Games (MMOGs) is essential for research in scalable architectures for these systems. We provide the first look into this problem through a measurement study on one of the most popular MMOGs, World of Warcraft [15]. Our goal is to answer four fundamental questions: how does the population of the virtual world change over time, how are players distributed in the virtual world, how much churn occurs with players, and how do they move in the virtual world. Through probing-based measurements, our preliminary results show that populations fluctuate according to a prime-time schedule, player distribution and churn appears to occur on a power-law distribution, and players move to only a small number of zones during each playing session. The ultimate goal of our research is to design an accurate player model for MMOGs so that future research can predict and simulate player behavior and population fluctuations over time.

REFERENCES

• 1: N. E. Baughman and B. N. Levine. Cheat-proof playout for centralized and distributed online games. In Proceedings of IEEE Infocom, pages 104--113, 2001.
• 2: Ashwin R. Bharambe , Mukesh Agrawal , Srinivasan Seshan, Mercury: supporting scalable multi-attribute range queries, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, August 30-September 03, 2004, Portland, Oregon, USA
• 3: Census+ UI add-on for World of Warcraft. http://www.warcraftrealms.com/censusplus.php.
• 4: C. Chambers, W. Feng, S. Sahu, and D. Saha. Measurement-based characterization of a collection of online games. In Proceedings of the Internet Measurement Conference, 2005.
• 5: C. Diot and L. Gautier. A distributed architecture for multiplayer interactive applications on the internet. IEEE Networks magazine, 13(4), July/August 1999.
• 6: EverQuest. http://everquest.station.sony.com.
• 7: Chris GauthierDickey , Virginia Lo , Daniel Zappala, Using n-trees for scalable event ordering in peer-to-peer games, Proceedings of the international workshop on Network and operating systems support for digital audio and video, June 13-14, 2005, Stevenson, Washington, USA [doi>10.1145/1065983.1066005]
• 8: Chris Gauthier Dickey , Daniel Zappala , Virginia Lo, A fully distributed architecture for massively multiplayer online games, Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games, August 30-30, 2004, Portland, Oregon, USA [doi>10.1145/1016540.1016566]
• 9: Jaecheol Kim , Jaeyoung Choi , Dukhyun Chang , Taekyoung Kwon , Yanghee Choi , Eungsu Yuk, Traffic characteristics of a massively multi-player online role playing game, Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games, October 10-11, 2005, Hawthorne, NY [doi>10.1145/1103599.1103619]
• 10: B. Knutsson, H. Lu, W. Xu, and B. Hopkins. Peer-to-peer support for massively multiplayer games. In Proceedings of IEEE Infocom, March 2004.
• 11: D. Kushner. Engineering EverQuest. IEEE Spectrum, July 2005.
• 12: The LUA Programming Language. http://www.lua.org.
• 13: S. Rooney, D. Bauer, and R. Deydier. A federated peer-to-peer network game architecture. IEEE Communications, 42(5), May 2004.
• 14: Swee Ann Tan , William Lau , Allan Loh, Networked game mobility model for first-person-shooter games, Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games, October 10-11, 2005, Hawthorne, NY [doi>10.1145/1103599.1103601]
• 15: World of Warcraft. http://www.worldofwarcraft.com.
• 16: XPilot. http://www.xpilot.org.