ACM Home Page
Please provide us with feedback. Feedback
Adaptive server selection for large scale interactive online games
Full text PdfPdf (209 KB)
Source International Workshop on Network and Operating System Support for Digital Audio and Video archive
Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video table of contents
Cork, Ireland
SESSION: Games table of contents
Pages: 152 - 157  
Year of Publication: 2004
ISBN:1-58113-801-6
Authors
Kang-Won Lee  IBM T.J. Watson Research, Hawthorne, NY
Bong-Jun Ko  Columbia University, New York, NY
Seraphin Calo  IBM T.J. Watson Research, Hawthorne, NY
Sponsors
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 26,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1005847.1005880
What is a DOI?

ABSTRACT

In this paper, we present a novel distributed algorithm that dynamically selects game servers for a group of game clients participating in large scale interactive online games. The goal of server selection is to minimize server resource usage while satisfying the real-time delay constraint. We develop a synchronization delay model for interactive games and formulate the server selection problem, and prove that the considered problem is NP-hard. The proposed algorithm, called zoom-in-zoom-out, is adaptive to session dynamics (e.g. clients join and leave) and lets the clients select appropriate servers in a distributed manner such that the number of servers used by the game session is minimized. Using simulation, we present the performance of the proposed algorithm and show that it is simple yet effective in achieving its design goal. In particular, we show that the performance of our algorithm is comparable to that of a greedy selection algorithm, which requires global information and excessive computation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Bar-Ilan and D. Peleg. Approximation algorithms for selecting network centers. In Proc. 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 519 pages 343--354, 1991.
2
 
3
P. Bettner and M. Terrano. 1500 archers on a 28.8: Network programming in age of empires and beyond. In Game Developers Conference 2001.
 
4
BRITE. http://www.cs.bu.edu/brite/
 
5
Butterfly.net. http://www.butterfly.net/
 
6
 
7
E. Cronin, B. Filstrup, and A. Kurc. A distributed multiplayer game server system, technical report, Univ. of michigan. Technical report, May 2001.
 
8
C. Diot and L. Gautier. A distributed architecture for multiplayer interactive applications on the internet, IEEE networks magazine, vol. 13, no. 4, July/August 1999.
 
9
10
 
11
 
12
PlanetSide. http://www.planetside.com/
 
13
L. Qiu, V. Padmanabham, and G.Voelker. On the placement of web server replicas. In Proc. 20th IEEE INFOCOM 2001 August 2001.
14
 
15
H. F. Salama, D. S. Reeves, and Y. Viniotis. An Efficient Delay-Constrained Minimum Spanning Tree Heuristic, Technical Report TR-96/46, North Carolina State University. Technical report,1996.
 
16
Terazona. http://www.zona.net/
 
17
D. G. Thaler and C. V. Ravishankar. Distributed center-location algorithms. IEEE Transactions on Selected Areas in Communications, vol. 15, issue 3 April 1997.


Collaborative Colleagues:
Kang-Won Lee: colleagues
Bong-Jun Ko: colleagues
Seraphin Calo: colleagues