Share Email Print
cover

Proceedings Paper

A heuristic for efficient data distribution management in distributed simulation
Author(s): Pankaj Gupta; Ratan K. Guha
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper, we propose an algorithm for reducing the complexity of region matching and efficient multicasting in data distribution management component of High Level Architecture (HLA) Run Time Infrastructure (RTI). The current data distribution management (DDM) techniques rely on computing the intersection between the subscription and update regions. When a subscription region and an update region of different federates overlap, RTI establishes communication between the publisher and the subscriber. It subsequently routes the updates from the publisher to the subscriber. The proposed algorithm computes the update/subscription regions matching for dynamic allocation of multicast group. It provides new multicast routines that exploit the connectivity of federation by communicating updates regarding interactions and routes information only to those federates that require them. The region-matching problem in DDM reduces to clique-covering problem using the connections graph abstraction where the federations represent the vertices and the update/subscribe relations represent the edges. We develop an abstract model based on connection graph for data distribution management. Using this abstract model, we propose a heuristic for solving the region-matching problem of DDM. We also provide complexity analysis of the proposed heuristics.

Paper Details

Date Published: 19 May 2005
PDF: 9 pages
Proc. SPIE 5805, Enabling Technologies for Simulation Science IX, (19 May 2005); doi: 10.1117/12.604070
Show Author Affiliations
Pankaj Gupta, Univ. of Central Florida (United States)
Ratan K. Guha, Univ. of Central Florida (United States)


Published in SPIE Proceedings Vol. 5805:
Enabling Technologies for Simulation Science IX
Dawn A. Trevisani; Alex F. Sisti, Editor(s)

© SPIE. Terms of Use
Back to Top