By Topic

An ACS-based partitioning method for distributed virtual environment systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. Morillo ; Instituto de Robotica, Valencia Univ., Spain ; M. Fernandez ; J. M. Orduna

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 (3D 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. The ACS method is an heuristic search method based on evolutionary computation. Performance evaluation results show that, due to its ability for 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 the ACS search method improves the scalability and efficiency of DVE systems.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003