摘要
With the development of networking technologies and computer graphics, distributed virtual environment (DVE) has become an important research area in computer science. In a DVE system, clients at different places can simultaneously explore a virtual world and interact with each other. How to build an efficient DVE system that can support large number of concurrent users is a challenge. In the paper, we discuss the way of partitioning the DVE world to balance the workload among different servers as well as minimize the inter-server communication. We present the existent mathematics mode and algorithms at first, and then give our algorithm, partitioning algorithm based on competition. Ex- periments are carried out to illustrate the effectiveness of our proposed algorithm.
With the development of networking technologies and computer graphics, distributed virtual environment (DVE) has become an important research area in computer science- In a DVE system, clients at different places can simultaneously explore a virtual world and interact with each other. How to build an efficient DVE system that can support large number of concurrent users is a challenge. In the paper, we discuss the way of partitioning the DVE world to balance the workload among different servers as well as minimize the inter-server communication. We present the existent mathematics mode and algorithms at first, and then give our algorithm, partitioning algorithm based on competition. Experiments are carried out to illustrate the effectiveness of our proposed algorithm.
出处
《计算机科学》
CSCD
北大核心
2001年第10期19-23,21,共6页
Computer Science
关键词
分布式虚拟环境
场景动态划分算法
数学模型
演化算法
虚拟现实
Distributed virtual environment, Virtual reality, Dynamic partitioning, Workload cost, Communication cost, Competition
