Performance Analysis of an Adaptive Dynamic Grid-Based Approach to Data Distribution Management

摘要

Data distribution management (DDM) plays a key role in traffic volume control of large-scale distributed simulations. In recent years, several solutions have been devised to make DDM more efficient and adaptive to different traffic conditions. Examples of such systems include region-based, fixed grid-based, hybrid, and dynamic grid-based (DGB) schemes. However, less effort has been made to improve the processing performance of DDM techniques. This paper presents a novel DDM scheme called the adaptive dynamic grid-based (ADGB) scheme that optimizes DDM time through analysis of matching performance. ADGB uses an advertising scheme in which information about the target cell involved in the process of matching subscribers to publishers is known in advance. An important concept known as distribution rate (DR) is devised. DR represents the relative processing load and traffic volume generated at each federate. The matching performance and DR are used as part of the ADGB method to select, throughout the simulation, the devised advertisement scheme that achieves maximum gain with acceptable network traffic overhead. Performance estimation and analysis of ADGB have shown that given an ideal matching probability, an efficiency gain of a maximum of 66% over the DGB scheme can be achieved. The novelty of the ADGB scheme is its focus on improving performance, an important (and often forgotten) goal of DDM strategies