摘要：

针对3D虚拟世界中的客户分配问题,提出一种基于二阶段的分配方法。把客户分配问题分为初始分配阶段和优化分配阶段,使得具有服务质量的客户数量最大化和分配成本最小化。在初始分配阶段为每个客户寻找一个目标服务器,在优化分配阶段为每个客户寻找一个触点服务器,并针对二阶段的客户分配问题提出随机分配区域算法、贪婪分配区域算法、基于虚拟位置的分配客户算法和贪婪分配客户算法。仿真结果表明,在初始分配阶段中考虑网络时延的算法明显优于不考虑网络时延的算法,同时能够较好地适应虚拟世界的动态变化特性,4种算法在网络平均通信时延和资源消耗方面都优于目前广泛采用的客户分配算法。

关键词: 二阶段, 虚拟世界, 交互性, 客户分配问题, 服务质量

Abstract:

Aiming at the client allocation problem in 3D Virtual World(VW),an allocation approach based on two-stage is proposed.The concrete implement is that the client allocation problem is divided into the initial allocation stage and refined allocation stage.The objective is that the total number of clients with Quality of Service(QoS) is maximized and the allocation cost is minimized.In the initial allocation stage,a target server is found for each client and then in the refined allocation stage,a contact server is found for each client.In the simulations,four algorithms for the two-stage allocation are simulated,and the results show that the algorithms that take into account network delays in the initial allocation stage significantly outperform those which do not.Moreover,the algorithms can well adapt to the dynamic change characteristics of VW.The performances for the allocation approach based on two-stage proposed are compared with which for the other two algorithms used widely at present,the results show that the allocation approach proposed in the average network communication delay and resource consumption outperforms the other two client allocation algorithms used widely.

Key words: two-stage, Virtual World(VW), interactivity, Client Allocation Problem(CAP), Quality of Service(QoS)

中图分类号: 

• TP391.9