Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
A Sexual Elitist Genetic Algorithm for Providing QoS in Distributed Virtual Environment Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
Greedy Algorithms for Client Assignment in Large-Scale Distributed Virtual Environments
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
A dynamical adjustment partitioning algorithm for distributed virtual environment systems
VRCAI '08 Proceedings of The 7th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
DS-RT '11 Proceedings of the 2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications
| Hi-index | 0.00 |
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment systems very common nowadays. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective DVE system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3-D avatars) to the servers in the system.This paper proposes a new implementation of the Ant Colony System (ACS) search method for solving the partitioning problem in DVE systems. ACS method is a heuristic search method based on evolutionary computation. Performance evaluation results show that, due to its ability of both finding good search paths and escaping from local minima, the proposed method can provide better solutions with shorter execution times than the methods proposed in the literature, particularly for large DVE systems. Therefore, the proposed implementation of ACS search method improves scalability and efficiency of DVE systems.