Displacement residual based DDM matching algorithm

High level architecture （HLA） is the prevailing standard for modeling and simulation. The data distribution management （DDM） service of HLA is defined for reducing the delivery of irrelevant data. The key in DDM implementation is the region overlap computation, i.e. the matching between update and subscription regions. Existing algorithms usnally make a compromise between region fidelity and network payload. This paper takes both the matching algorithm efficiency and bandwidth cost into account. The main contributions are： 1） illustrating the relationship between region changes and overlap changes, as helps reduce the number of region matching and then improves the total matching efficiency; 2） classifying region updates into two types of data expression, snapshot and residual. The network traffic will be reduced by transinitting only residual data instead of full region representations occasionally. Consequently, a region matching algorithm called displaeement residual-based DDM matching （DRBM） is proposed in the paper. Theoretical analysis, algorithm implementation and experiment evaluation are presented. Experinment results show that DRBM provides better matching performance and significant network payload reductions especially when there is a large number of changing regions.