LoI:Effcient relevance evaluation and filtering for distributed simulation
LoI:Effcient relevance evaluation and filtering for distributed simulation出 版 物:《Science in China(Series F)》 (中国科学(F辑英文版))
年 卷 期:2009年第52卷第3期
页 面:470-489页
学科分类:080902[工学-电路与系统] 0809[工学-电子科学与技术(可授工学、理学学位)] 08[工学] 080203[工学-机械设计及理论] 0802[工学-机械工程]
基 金:Supported by the National Basic Research Program of China (Grant No. 2009CB320805) the National Natural Science Foundation of China(Grant No. 60603084) the National High-Tech Research & Development Program of China (Grant No. 2006AA01Z331)
主 题:distributed simulation high level architecture (HLA) relevance evaluation layer of interest (Lol) run-time infrastructure (RTI)
摘 要:In large-scale distributed simulation, thousands of objects keep moving and interacting in a virtual environment, which produces a mass of messages. High level architecture (HLA) is the prevailing standard for modeling and simulation. It specifies two publish-subscribe mechanisms for message filtering: class-based and value-based. However, the two mechanisms can only judge whether a message is relevant to a subscriber or not. Lacking of the ability to evaluate the relevance, all relevant messages are delivered with the same priority even when congestion occurs. It significantly limits the scalability and performance of distributed simulation. Aiming to solve the relevance evaluation problem, speed up message filtering, and filter more unnecessary messages, a new relevance evaluation mechanism Layer of Interest (Lol) was proposed by this paper. Lol defines a relevance classifier based on the impact of spatial distance on receiving attributes and attribute values. An adaptive publish-subscribe scheme was built on the basis of Loh This scheme can abandon most irrelevant messages directly. Run-time infrastructure (RTI) can also apply congestion control by reducing the frequency of sending or receiving object messages based on each objects' Loh The experiment results verify the efficiency of message filtering and RTI congestion control.