CAMEO: Continuous Analytics for Massively Multiplayer Online Games on Cloud Resources

  • Alexandru Iosup
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6043)


Massively Multiplayer Online Games (MMOGs) have grown to entertain tens of millions of players daily. Currently, the game operators and third-parties using gameplay information rely on pre-provisioned resources to analyze the current status of the player community and the evolution of this status over time. Instead, with the appearance of cloud computing it has become attractive to use on-demand resources to run automated MMOG data analytics tools. Thus, in this work we introduce CAMEO, an architecture for Continuous Analytics for Massively multiplayEr Online games on cloud resources. Our architecture provides various mechanisms for MMOG data collection and continuous analytics of a pre-determined accuracy in real settings. We assess the capabilities of our approach by taking and analyzing complete or partial snapshots from Runescape, one of the most popular MMOGs with a community of over 3,000,000 active players. Notably, we show evidence that CAMEO already supports simple continuous MMOG analytics, and give a first estimation of the costs of the analytic process.


Cloud Computing Skill Level Cloud Resource Continuous Analytic Cloud Computing Environment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arasu, A., Cho, J., Garcia-Molina, H., Paepcke, A., Raghavan, S.: Searching the web. ACM Trans. Internet Technol. 1(1), 2–43 (2001)CrossRefGoogle Scholar
  2. 2.
    Cho, J., Garcia-Molina, H.: Parallel crawlers. In: WWW, pp. 124–135 (2002)Google Scholar
  3. 3.
    Lee, H.-T., Leonard, D., Wang, X., Loguinov, D.: Irlbot: scaling to 6 billion pages and beyond. In: WWW, pp. 427–436 (2008)Google Scholar
  4. 4.
    Provost, F.J., Kolluri, V.: A survey of methods for scaling up inductive algorithms. Data Min. Knowl. Discov. 3(2), 131–169 (1999)CrossRefGoogle Scholar
  5. 5.
    Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW, pp. 131–140 (2007)Google Scholar
  6. 6.
    Yu, H., Vahdat, A.: Efficient numerical error bounding for replicated network services. In: VLDB ’00: Proceedings of the 26th International Conference on Very Large Data Bases, pp. 123–133. Morgan Kaufmann Publishers Inc., San Francisco (2000)Google Scholar
  7. 7.
    Alonso, R., Barbará, D., Garcia-Molina, H.: Data caching issues in an information retrieval system. ACM Trans. Database Syst. 15(3), 359–384 (1990)CrossRefGoogle Scholar
  8. 8.
    Nae, V., Iosup, A., Podlipnig, S., Prodan, R., Epema, D.H.J., Fahringer, T.: Efficient management of data center resources for massively multiplayer online games. In: ACM/IEEE SuperComputing, IEEE/ACM (2008)Google Scholar
  9. 9.
    Steinkuehler, C., Williams, D.: Where everybody knows your (screen) name: Online games as “third places”. In: DIGRA Conf. (2005)Google Scholar
  10. 10.
    Castronova, E.: On virtual economies. Game Studies 3(2) (2003)Google Scholar
  11. 11.
    Williams, D., Yee, N., Caplan, S.: Who plays, how much, and why? debunking the stereotypical gamer profile. Journal of Computer-Mediated Communication 13(4), 993–1018 (2008)CrossRefGoogle Scholar
  12. 12.
    BBC NEws, Virtual game is a ’disease model’, News Item (September 2009),
  13. 13.
    Yee, N.: The demographics, motivations, and derived experiences of users of massively multi-user online graphical environments. Presence 15(3), 309–329 (2006)CrossRefGoogle Scholar
  14. 14.
    Iosup, A.: POGGI: Puzzle-based Online Games on Grid Infrastructures. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009 Parallel Processing. LNCS, vol. 5704, pp. 390–403. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. 15.
    Iosup, A., Tannenbaum, T., Farrellee, M., Epema, D.H.J., Livny, M.: Inter-operating grids through delegated matchmaking. Scientific Programming 16(2-3), 233–253 (2008)Google Scholar
  16. 16.
    The Cloud Status Team, JSON report crawl (January 2009),
  17. 17.
    Palankar, M.R., Iamnitchi, A., Ripeanu, M., Garfinkel, S.: Amazon S3 for science grids: a viable solution? In: DADC ’08: Proceedings of the 2008 international workshop on Data-aware distributed computing, pp. 55–64. ACM, New York (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Alexandru Iosup
    • 1
  1. 1.Electrical Eng., Mathematics and Computer Science DepartmentDelft University of TechnologyDelftThe Netherlands

Personalised recommendations