Performance Evaluation of a Dead Reckoning Mechanism.

Authors:
Corentin Durbach;Jean-Michel Fourneau
Affiliations:
-;-
Venue:
DIS-RT '98 Proceedings of the Second International Workshop on Distributed Interactive Simulation and Real-Time Applications
Year:
1998

Citing 0
Cited 6

An auto-adaptive dead reckoning algorithm for distributed interactive simulation

PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Power-aware State Dissemination in Mobile Distributed Virtual Environments

Proceedings of the seventeenth workshop on Parallel and distributed simulation
Using cursor prediction to smooth telepointer jitter

GROUP '03 Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work
On Consistency and Network Latency in Distributed Interactive Applications: A Survey—Part II: Presence 2005: Eighth International Workshop I

Presence: Teleoperators and Virtual Environments
Remote control point motion prediction in internet-based real-time collaborative graphics editing systems

CRIWG'05 Proceedings of the 11th international conference on Groupware: design, Implementation, and Use
A dynamic message filtering technique for 3D cyberspaces

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dead Reckoning mechanism allows to reduce the network bandwidth utilization considerably. As available bandwith is the key problem for large DIS, we expect that a Dead Reckoning mechanism will allow to increase the number of entities involved in a DIS exercise.In this paper we model a Dead Reckoning mechanism and we present an evaluation of its performance. Such a mechanism reduces the number of PDU exchanged during the simulation. But it also completly changes the nature of the stochastic process which models the arrivals of PDUs. Indeed, it adds some kind of sporadicity. We present some measurements on a DIS simulator which exhibits such a behaviour. Then we investigate the effects of such a mechanim in terms of response time and number of allowed entities using a simulation tool. Some extensions towards the numerical resolution of a large Markov chain associated to the problem are finally presented.