The Community for Technology Leaders
2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation (2009)
Lake Placid, New York, USA
June 22, 2009 to June 25, 2009
ISSN: 1087-4097
ISBN: 978-0-7695-3713-9
pp: 137-144
This paper deals with the zone mapping problem in large-scale distributed virtual environments (DVEs), e.g., massively multi-player online games, distributed military simulations, etc. To support such large-scale DVEs with real-time interactions among thousands of concurrent, geographically separated clients, a distributed server infrastructure is generally needed, and the virtual world can be partitioned into several distinct zones to distribute the load among the servers. The NP-hard zone mapping problem concerns how to assign the zones of the virtual world to a number of distributed servers to improve interactivity. In this paper, we propose new zone mapping algorithms based on a Linear Programming relaxation of the original problem and meta-heuristics such as local search and evolutionary optimization techniques. We conducted extensive experiments with realistic Internet latency models obtained from real measurements using millions of pairs of geographically distributed IP addresses. The results have shown that our newly proposed algorithms significantly improved the performance of large-scale DVEs in terms of overall interactivity, when compared with existing mechanisms.
zone mapping, distributed virtual environments, metaheuristics

D. N. Ta, R. Ayani, W. Cai, S. Zhou and X. Tang, "Efficient Zone Mapping Algorithms for Distributed Virtual Environments," 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation(PADS), Lake Placid, New York, USA, 2009, pp. 137-144.
81 ms
(Ver 3.3 (11022016))