Region Matching Algorithm Based on Hierarchical Dividing of Routing Space
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

史扬,凌云翔,金士尧,胡华平.基于路径空间层次划分的区域匹配算法.软件学报,2001,12(5):758-767

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 30,1998
  • Revised:February 25,2000
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063