Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
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
Improving the Performance of Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
Measurement based analysis, modeling, and synthesis of the internet delay space
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Efficient Zone Mapping Algorithms for Distributed Virtual Environments
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
| Hi-index | 0.00 |
In Distributed Virtual Environment (DVE) systems, a distributed server infrastructure is often used to reduce the latency between servers and clients. Under this infrastructure, mapping clients to proper servers is one of the key issues for improving the interactivity and overall performance. Most traditional methods of mapping the clients to servers only consider the load balancing problem. However, there are two other important aspects that should be involved: the physical world integrity and the virtual world integrity. In this work, we propose a novel mapping algorithm which takes care of all three aspects at the same time. The algorithm converts the mapping problem into cutting stage and matching stage to get optimal result with polynomial complexity. The experimental results show that our algorithm improves the overall performance of DVE systems significantly.