Parallel proximity detection and the distribution list algorithm
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Three-tiered interest management for large-scale virtual environments
VRST '98 Proceedings of the ACM symposium on Virtual reality software and technology
Dynamic grid-based approach to data distribution management
Journal of Parallel and Distributed Computing - Parallel and Distributed Discrete Event Simulation--An Emerging Technology
High Level Architecture for Simulation: An Update
DIS-RT '98 Proceedings of the Second International Workshop on Distributed Interactive Simulation and Real-Time Applications
An Agent-Based DDM Filtering Mechanism
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
VRAIS '95 Proceedings of the Virtual Reality Annual International Symposium (VRAIS'95)
Design of High Performance RTI Software
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
A Hybrid Approach to Data Distribution Management
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
Data Distribution Management Migration from DoD 1.3 to IEEE 1516"
DS-RT '01 Proceedings of the Fifth IEEE International Workshop on Distributed Simulation and Real-Time Applications
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
Large Scale Distributed Virtual Environments on the Grid: Design, Implementation, and a Case Study
Computer Supported Cooperative Work in Design IV
Transparent optimistic synchronization in the high-level architecture via time-management conversion
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
Data distribution management (DDM) plays a key role in traffic control for 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 the region-based, fixed grid-based, and dynamic grid-based (DGB) schemes, as well as grid-filtered region-based and agent-based DDM schemes. However, less effort has been directed toward improving 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 the 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 the distribution rate (DR) is devised. The DR represents the relative processing load and communication load generated at each federate. The DR and the matching performance are used as part of the ADGB method to select, throughout the simulation, the devised advertisement scheme that achieves the maximum gain with acceptable network traffic overhead. If we assume the same worst case propagation delays, when the matching probability is high, the performance estimation of ADGB has shown that a maximum efficiency gain of 66% can be achieved over the DGB scheme. The novelty of the ADGB scheme is its focus on improving performance, an important (and often forgotten) goal of DDM strategies.