Bounding Inconsistency Using A Novel Threshold Metric For Dead Reckoning Update Packet Generation  

Oleh:

Roberts, Dave ; Aspin, Rob ; Marshall, Damien ; McLoone, Seamus ; Delaney, Declan ; Ward, Tomas

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Simulation vol. 84 no. 5 (May 2008), page 239-256.
Topik: Key words text
Fulltext: 239.pdf (893.44KB)

Isi artikel

Human-to-human interaction across distributed applications requires that sufficient consistency be maintained among participants in the face of network characteristics such as latency and limited bandwidth. The level of inconsistency arising from the network is proportional to the network delay, and thus a function of bandwidth consumption. Distributed simulation has often used a bandwidth reduction technique known as dead reckoning that combines approximation and estimation in the communication of entity movement to reduce network traffic, and thus improve consistency. However, unless carefully tuned to application and network characteristics, such an approach can introduce more inconsistency than it avoids. The key tuning metric is the distance threshold. This paper questions the suitability of the standard distance threshold as a metric for use in the dead reckoning scheme. Using a model relating entity path curvature and inconsistency, a major performance related limitation of the distance threshold technique is highlighted. We then propose an alternative time–space threshold criterion. The time–space threshold is demonstrated, through simulation, to perform better for low curvature movement. However, it too has a limitation. Based on this, we further propose a novel hybrid scheme. Through simulation and live trials, this scheme is shown to perform well across a range of curvature values, and places bounds on both the spatial and absolute inconsistency arising from dead reckoning.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali