Publication Type

Journal Article

Version

submittedVersion

Publication Date

3-2011

Abstract

In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed servers to improve overall interactivity. Previously, this problem has been formulated as a single-objective optimization problem, in which the objective is to minimize the total number of clients that are without QoS. This approach may cause considerable network traffic and processing overhead, as a large number of zones may need to be migrated across servers. In this paper, we introduce a multi-objective approach to the zone mapping problem, in which both the total number of clients without QoS and the migration overhead are considered. To this end, we have proposed several new algorithms based on meta-heuristics such as local search and multi-objective evolutionary optimization techniques. Extensive simulation studies have been conducted with realistic network latency data modeled after actual Internet measurements, and different workload distribution settings. Simulation results demonstrate the effectiveness of the newly proposed algorithms.

Keywords

Distributed virtual environments, Multi-objective optimization, Geographically distributed server architecture, Zone mapping, Interactivity enhancement

Discipline

Numerical Analysis and Scientific Computing | Theory and Algorithms

Publication

Journal of Network and Computer Applications

Volume

34

Issue

2

First Page

551

Last Page

561

ISSN

1084-8045

Identifier

10.1016/j.jnca.2010.12.008

Publisher

Elsevier

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1016/j.jnca.2010.12.008

Download

Share

COinS