Shawn Farlow
ABSTRACT
The Client Assignment Problem is an NP-hard problem applicable to online games in which a set of clients must be satisfactorily assigned to a subset of all available servers subject to various criteria. One particular variant of that problem we have defined as Offline CAP-Z separates the game world into zones and calls for heuristics to assign zones to servers such that a minimum fraction of players achieves a connection speed faster than a threshold of game quality known as QoS. We develop novel heuristics based on bin packing to find assignments much faster than previous solutions to CAP-Z while using a comparable number of servers.
- Armitage, G. (2008), Optimising Online FPS Game Server Discovery through Clustering Servers by Origin Autonomous System. Proc. 18th Int'l. Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), pp. 3--8. Google Scholar
Digital Library
- Beskow, P.B., Vik, H.-H., Halvorsen, P., and Griwodz, C., (2009), The Partial Migration of Game State and Dynamic Server Selection to Reduce Latency. Multimedia Tools and Applications, vol. 45, nos. 1--3, pp. 83--107. Google ScholarDigital Library
- Bortnikov, E., Khuller, S., Li, J., Mansour, Y. and Naor, J. S. (2012), The Load-distance Balancing Problem. Networks 59, pp. 22--29. Google ScholarCross Ref
- Chertov, R., and Fahmy, S. (2006), Optimistic Load Balancing in a Distributed Virtual Environment. NOSSDAV 06, Proceedings of the 2006 international workshop on network and operating systems support for digital audio and video. Article No. 13. Google ScholarDigital Library
- Cormen, T.; Leiserson, C., Rivest, R., Stein, C. (2009) [1990], Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill.Google Scholar
- Nguyen, C.D., Safaei, F., and Boustead, P. (2006), Optimal Assignment of Distributed Servers to Virtual Partitions for the Provision of Immersive Voice Communication in Massively Multiplayer Games. Computer Communications, vol. 29, no. 9, pp. 1260--1270. Google ScholarDigital Library
- Ta, D. N. B., Zhou, S., Cai, W., Tang, X., and Ayani, R. (2009), Efficient Zone Mapping Algorithms for Distributed Virtual Environments. Proc. ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation (PADS), pp. 137--144. Google ScholarDigital Library
- Ta, D. N. B., Zhou, S., Cai, W., Tang, X., and Ayani, R. (2011), Multi-Objective Zone Mapping in Large-Scale Distributed Virtual Environments. J. Network and Computer Applications, vol. 34, no. 2, pp. 551--561. Google ScholarDigital Library
- Ta, D., Nguyen, T., Zhou, S., and Tang, X. (2012), Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments. Parallel and Distributed Systems, IEEE Transactions on, Volume 23, Issue 2.Google Scholar
- World of Warcraft. http://www.worldofwarcraft.comGoogle Scholar
- Zhang, L. and Tang, X. (2011), Client Assignment for Improving Interactivity in Distributed Interactive Applications. Proc. IEEE INFOCOM, 9 pp. Google ScholarCross Ref
- Zhang, L. and Tang, X. (2012), Optimizing Client Assignment for Enhancing Interactivity in Distributed Interactive Applications. IEEE/ACM Trans. Networking, vol. 20, no. 6, pp. 1707--1720 + 5 pp. supplement.Google ScholarDigital Library
- Zhang, L. and Tang, X. (2014), The Client Assignment Problem for Continuous Distributed Interactive Applications: Analysis, Algorithms, and Evaluation. IEEE Trans. Par. Distrib. Sys., vol. 25, no. 3, pp. 785--795 + 8 pp. supplement.Google ScholarDigital Library
Index Terms
- Greedy heuristics for client assignment problem by zones
Recommendations
Online Client Assignment in Dynamic Real-Time Distributed Interactive Applications
DS-RT '13: Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time ApplicationsQuality of user experience in Distributed Interactive Applications(DIAs) highly depends on the network latencies during the system execution. In DIAs, each user is assigned to a server and communication with any other client is performed through its ...
A tabu search algorithm for the quadratic assignment problem
Tabu search approach based algorithms are among the widest applied to various combinatorial optimization problems. In this paper, we propose a new version of the tabu search algorithm for the well-known problem, the quadratic assignment problem (QAP). ...
GRASP with Path Relinking for Three-Index Assignment
This paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart metaheuristic for combinatorial optimization. It usually consists of a ...
Comments