ACM Transactions on Modeling and Computer Simulation (TOMACS)
Networked virtual environments: design and implementation
Networked virtual environments: design and implementation
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
On the suitability of dead reckoning schemes for games
NetGames '02 Proceedings of the 1st workshop on Network and system support for games
Distributed Virtual Environments
IEEE Computer Graphics and Applications
BRITE: A Flexible Generator of Internet Topologies
BRITE: A Flexible Generator of Internet Topologies
Time-space consistency in large-scale distributed virtual environments
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Influences of network latency and packet loss on consistency in networked racing games
NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
Managing latency and fairness in networked games
Communications of the ACM - Entertainment networking
Globally synchronized dead-reckoning with local lag for continuous distributed multiplayer games
NetGames '06 Proceedings of 5th ACM SIGCOMM workshop on Network and system support for games
A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
Network-Aware Server Placement for Highly Interactive Distributed Virtual Environments
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Effect of Network Quality on Player Departure Behavior in Online Games
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Multi-server architecture is very popular in Distributed Virtual Environments. Although multi-server architecture has good scalability, the load balance and consistency are still challenging issues. Because of server resource limitations (computation, communication etc), the consistency of the virtual world cannot be guaranteed sometimes. In this paper, we address this problem by developing scheduling polices and try to get better overall consistency with limited resources. We formulate the problem by using integer programming model and propose a centralized approximate algorithm. A distributed update strategy is also developed accordingly. Our algorithm is validated by theoretical analysis and wide range of experiments.