Greedy heuristics for client assignment problem by zones
Document Type
Conference Proceeding
Publication Date
8-14-2017
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.
Publication Source (Journal or Book title)
ACM International Conference Proceeding Series
Recommended Citation
Farlow, S., & Trahan, J. (2017). Greedy heuristics for client assignment problem by zones. ACM International Conference Proceeding Series, Part F130151 https://doi.org/10.1145/3102071.3102087
