Literature Database Entry
nae2008efficient
Vlad Nae, Alexandru Iosup, Stefan Podlipnig, Radu Prodan, Dick Epema and Thomas Fahringer, "Efficient Management of Data Center Resources for Massively Multiplayer Online Games," Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis (SC 08), Austin, TX, November 2008.
Abstract
Today's massively multiplayer online games (MMOGs) can include millions of concurrent players spread across the world. To keep these highly-interactive virtual environments online, a MMOG operator may need to provision tens of thousands of computing resources from various data centers. Faced with large resource demand variability, and with misfit resource renting policies, the current industry practice is to maintain for each game tens of self-owned data centers. In this work we investigate the dynamic resource provisioning from external data centers for MMOG operation. We introduce a novel MMOG workload model that represents the dynamics of both the player population and the player interactions. We evaluate several algorithms, including a novel neural network predictor, for predicting the resource demand. Using trace-based simulation, we evaluate the impact of the data center policies on the resource provisioning efficiency; we show that dynamic provisioning can be much more efficient than its static alternative.
Quick access
Original Version
(at publishers web site)
BibTeX ![]()
Contact
Vlad Nae
Alexandru Iosup
Stefan Podlipnig
Radu Prodan
Dick Epema
Thomas Fahringer
BibTeX reference
@inproceedings{nae2008efficient,
author = {Nae, Vlad and Iosup, Alexandru and Podlipnig, Stefan and Prodan, Radu and Epema, Dick and Fahringer, Thomas},
doi = {10.1109/SC.2008.5213940},
title = {{Efficient Management of Data Center Resources for Massively Multiplayer Online Games}},
publisher = {IEEE},
address = {Austin, TX},
booktitle = {International Conference for High Performance Computing, Networking, Storage and Analysis (SC 08)},
month = {11},
year = {2008},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
This page was automatically generated using BibDB and bib2web.








