基于路径空间层次划分的区域匹配算法

随着仿真应用在广度及深度上的发展,基于因特网的分布交互仿真成为未来的发展方向.其面临的主要挑战之一是系统可扩缩性问题.采用高效的数据过滤机制是解决问题的有效手段.首先讨论了分布交互仿真存在的可扩缩性问题,介绍了HLA(high level yarchitecture)框架下数据过滤机制的原理、实现及存在的问题.针对大规模系统过滤匹配计算量大的问题,提出了一种基于路径空间层次划分方法.该方法利用空间位置关系知识进行启发式搜索,从而排除大量不相关区域的匹配计算,有效地降低了过滤机制的计算复杂度.

Region Matching Algorithm Based on Hierarchical Dividing of Routing Space

With the simulation applications developing in extent and profundity, Internet based distributed simulation becomes the trend in the future. It faces the challenge of system scalability. Data filtering is an efficient method to improve system scalability. In this paper, after discussing the problem of system scalability, the principle, the implementation, the problems of data filtering under HLA (high level architecture) are introduced. In order to solve the problem of too much matching computation, a novel method is proposed to reduce region match computation in data filtering based on hierarchical diving of routing space. This method can reduce matching computation by suing region location knowledge to execute efficient prune searching.