Integer and combinatorial optimization
Integer and combinatorial optimization
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
On caching and prefetching of virtual objects in distributed virtual environments
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Networked virtual environments: design and implementation
Networked virtual environments: design and implementation
Practical genetic algorithms
A hybrid motion prediction method for caching and prefetching in distributed virtual environments
VRST '01 Proceedings of the ACM symposium on Virtual reality software and technology
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
A multi-server architecture for distributed virtual walkthrough
VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
mWorld: A Multiuser 3D Virtual Environment
IEEE Computer Graphics and Applications
Adaptive partitioning for multi-server distributed virtual environments
Proceedings of the tenth ACM international conference on Multimedia
A Motion Prediction Method for Mouse-Based Navigation
CGI '01 Computer Graphics International 2001
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
Networked games: a QoS-sensitive application for QoS-insensitive users?
RIPQoS '03 Proceedings of the ACM SIGCOMM workshop on Revisiting IP QoS: What have we learned, why do we care?
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
Proceedings of the ACM symposium on Virtual reality software and technology
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
Improving the Performance of Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
GameOD: an internet based game-on-demand framework
Proceedings of the ACM symposium on Virtual reality software and technology
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Making Networked Virtual Environments Work
Presence: Teleoperators and Virtual Environments
A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
The effect of latency on user performance in Real-Time Strategy games
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
CyberWalk: a web-based distributed virtual walkthrough environment
IEEE Transactions on Multimedia
Multiserver support for large-scale distributed virtual environments
IEEE Transactions on Multimedia
A heuristic method for analyzing driver scheduling problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Joint Optimization of Hardware and Network Costs for Distributed Computer Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
A necessary condition for providing quality of service to distributed virtual environments (DVEs) is to provide a system response below a maximum threshold to the client computers. In this sense, latency-aware partitioning methods try to provide response times below the threshold to the maximum number of client computers as possible. These partitioning methods should find an assignment of clients to servers that optimizes system throughput, system latency, and partitioning efficiency. In this paper, we present a new algorithm based on greedy randomized adaptive search procedure with memory for finding the best solutions as possible to this problem. We take into account several different alternatives in order to design both the constructive phase and the local search phase of this multistart metaheuristic for combinatorial problems. Additionally, we enhance this basic approach with some intensification strategies that improve the efficiency of the basic search method. Performance evaluation results show that the new algorithm increases the performance provided by other metaheuristics when applied to solve the latency-aware partitioning problem in DVE systems.