20th Workshop on Principles of Advanced and Distributed Simulation (PADS'06) (2006)
May 24, 2006 to May 26, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PADS.2006.19
Duong Nguyen Binh Ta , Nanyang Technical University, Singapore
Suiping Zhou , Nanyang Technical University, Singapore
Haifeng Shen Shen , Nanyang Technical University, Singapore
Distributed Virtual Environments (DVEs), such as online games, military simulations, collaborative design, etc., are very popular nowadays. To support large-scale DVEs, a multi-server architecture is usually employed, and the virtual world is partitioned into multiple zones for load distribution. The client assignment problem arises when assigning the participating clients to the servers. Current approaches usually assign clients to servers according to the locations of clients in the virtual world, i.e., clients interacting in the same zone of the virtual world will be assigned to the same server. This approach may degrade the interactivity of DVEs if the network delay from a client to its assigned server is large. In this paper, we formulate the client assignment problem, and propose two algorithms to assign clients to servers in a more efficient way. The proposed algorithms are based on the heuristics developed for the well-known Terminal Assignment problem. Simulation results with the BRITE Internet Topology Generator show that our algorithms are effective in enhancing the interactivity of DVEs.
H. S. Shen, D. N. Ta and S. Zhou, "Greedy Algorithms for Client Assignment in Large-Scale Distributed Virtual Environments," 20th Workshop on Principles of Advanced and Distributed Simulation (PADS'06)(PADS), Singapore, 2006, pp. 103-110.