Multicast tree allocation algorithms for Distributed Interactive Simulation

  • Authors:
  • Dominique Barth;Johanne Cohen;Corentin Durbach

  • Affiliations:
  • PRiSM-CNRS, Universite de Versailles-St Quentin en Yvelines, 45 avenue des Etats-Unis 78035 Versailles Cedex, France.;LORIA-CNRS, 615 Rue du Jardin Botanique, 54602 Villers les Nancy, France.;PRiSM-CNRS, Universite de Versailles-St Quentin en Yvelines, 45 avenue des Etats-Unis 78035 Versailles Cedex, France

  • Venue:
  • International Journal of High Performance Computing and Networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider real-time communications required by a Distributed Interactive Simulation (DIS), using multipoint communication technics. We focus here on a classical interactive game between participants distributed on a geographic map, where each participant is associated to a square cell on it. The needs of communication between participants are represented by a graph. The problem we consider consists in covering efficiently this graph by groups of nodes, and in allocating in the target network a subtree with a given bandwidth to each group. The problem is proved NP-complete. Lower bounds, and two heuristics with their analysis are provided.