Telecommunications network design algorithms
Telecommunications network design algorithms
NetEffect: a network architecture for large-scale multi-user virtual worlds
VRST '97 Proceedings of the ACM symposium on Virtual reality software and technology
Networked virtual environments: design and implementation
Networked virtual environments: design and implementation
Heuristic algorithms for the terminal assignment problem
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
A scalable architecture for supporting interactive games on the internet
Proceedings of the sixteenth workshop on Parallel and distributed simulation
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
mWorld: A Multiuser 3D Virtual Environment
IEEE Computer Graphics and Applications
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
Behavior and Performance of Interactive Multi-Player Game Servers
Cluster Computing
Time-space consistency in large-scale distributed virtual environments
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Adaptive server selection for large scale interactive online games
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
An application of distributed virtual environment to foreign language education
FIE '00 Proceedings of the 30th Annual Frontiers in Education - Volume 01
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
Distributed virtual environments (DVEs) are distributed systems that allow multiple geographically distributed clients to interact concurrently in a shared virtual world. DVEs, such as online games, military simulations, and collaborative design, etc., are very popular nowadays. To support scalable DVEs, a multi-server architecture is usually employed, and the virtual world is partitioned into several zones to distribute the load among servers. The client assignment problem arises when assigning the participating clients in the zones to servers. Current approaches usually assign clients to servers according to the locations of clients in the virtual world; i.e., clients interacting in a zone of the virtual world will be assigned to the same server. This approach may degrade the interactivity of DVEs if the network delay from a client to its assigned server is large. In this paper, we formulate the client assignment problem and propose two algorithms to assign clients to servers in a more efficient way. The proposed algorithms are based on the heuristics developed for the well-known terminal assignment problem. Simulation results with the BRITE Internet Topology Generator show that our algorithms are effective in enhancing the interactivity of DVEs.