Accuracy in dead-reckoning based distributed multi-player games

Aggarwal, Sudhir; Banavar, Hemant; Khandelwal, Amit; Mukherjee, S.; Rangarajan, Sampath

doi:10.1145/1016540.1016559

Cited by 80 publications

(69 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As we shall discuss in detail, there are three fundamental approaches to compensating for lag: dead reckoning [1], delaying local inputs [9], and remote lag [3]. These techniques are notoriously difficult to program, and their effects are difficult to analyze.…”

Section: Why Time Mattersmentioning

confidence: 99%

“…When a state update arrives over the network, prediction can be used to estimate the state's current value, as opposed to the value at the time the message was sent. To achieve this, state update messages must be timestamped, and the clocks on the local and remote clients must be synchronized [1]. Finally, if smooth corrections [34] are used to repair incorrect predictions, the programmer must be able to access states from the past, present and future, as shown in Fig.…”

Section: Using Timelinesmentioning

confidence: 99%

“…Typically, when a client receives a positional update, that position is set as the entity location at the current local time, not at the time the message was sent. Aggarwal et al [1] have shown that treating remote updates as past events (i.e., accounting for network latency) improves the accuracy of dead reckoning. However, this approach requires the programming complexities of timestamping positional update messages and synchronizing the clocks on the local and remote clients.…”

Section: Example: Dead Reckoningmentioning

confidence: 99%

See 2 more Smart Citations

Timelines: simplifying the programming of lag compensation for the next generation of networked games

Savery

Graham

2012

Multimedia Systems

View full text Add to dashboard Cite

Lag compensation algorithms used in networked games require programmers to manage the complexities of dealing with both time and shared state. This can make implementing lag compensation techniques challenging. The difficulties in expressing these algorithms limit experimentation with different algorithms and inhibit programmers from exploring the space of the algorithms and testing their effects. The solution is to have a programming model that is better able to deal with time. In this paper, we present such a programming model, timelines. Timelines dramatically reduce the time and effort required to implement lag compensation techniques by allowing for the explicit treatment of time. The timelines model has been implemented as part of the Janus toolkit.

show abstract

Section: Why Time Mattersmentioning

confidence: 99%

Section: Using Timelinesmentioning

confidence: 99%

Section: Example: Dead Reckoningmentioning

confidence: 99%

See 1 more Smart Citation

Timelines: simplifying the programming of lag compensation for the next generation of networked games

Savery

Graham

2012

Multimedia Systems

View full text Add to dashboard Cite

show abstract

“…Phase difference has been defined as a consistency metric that represents the temporal difference between the rendering times for local and remote entity models [21]. Export error has been defined as the deviation in physical time of the remote entity model from the local entity model [22]. Deviation and uncertainty have been defined as absolute spatial difference and the size of the area in which an entity could reside in, respectively [17].…”

Section: B) Measures Of Consistencymentioning

confidence: 99%

Formalizing a framework for dynamic hybrid strategy models in distributed interactive applications

McCoy¹,

Ward²,

McLoone³

et al. 2006

IET Irish Signals and Systems Conference (ISSC 2006)

View full text Add to dashboard Cite

Predictive contract mechanisms such as dead reckoning are widely employed to support scalable remote entity modelling in Distributed Interactive Applications (DIAs). By employing a form of controlled inconsistency, a reduction in network traffic is achieved. Previously, we have proposed the Dynamic Hybrid Strategy Model (DHSM) as an extension to the concept of dead reckoning that adaptively selects extrapolation models based on the use of local performance criteria. In this paper, we formalize the notion of the DHSM as a generalized framework for network traffic reduction in DIAs, alongside a set of consistency metrics for use as local performance criteria.Keywords -distributed interactive applications, predictive contract mechanisms, dead reckoning, consistency, scalability. __________________________________________________________________________________________ I INTRODUCTIONA Distributed Interactive Application (DIA) is a distributed virtual reality system through which individuals can share information via individual and collaborative interaction with each other and their environment [1]. Distributed Interactive Applications offer the realization of simulated virtual worlds that embody a modern extension of communication, encompassing the concepts of shared time, shared space and shared presence [2]. The definition of a DIA encompasses a diverse range of applications that have seen rapid advances in technology and global popularity due to the widespread availability and ease-of-use of the Internet [3].The two primary factors limiting the large-scale deployment of a DIA are network latency and network bandwidth. Network latency refers to the delay in communication between two end-points, while network bandwidth refers to the rate at which data can be communicated per unit time between two end-points. High network latency and low network bandwidth capacity represent the largest contributors to the difficulties faced by DIAs in maintaining and supporting: (a) shared state consistency, (b) potential scalability, and (c) real-time interactivity.In this paper, we are concerned with the use of predictive contract mechanisms for the reduction of network traffic in DIAs, including the well-known dead reckoning algorithms formally defined in the IEEE Standard for Distributed Interactive Simulation (DIS) [4]. Traditional dead reckoning mechanisms often ignore available contextual information that may be influential to the state of an entity, sacrificing remote predictive accuracy in favour of low resource and computational overhead [2]. Previously, we have proposed an extension of dead reckoning, known as the Dynamic Hybrid Strategy Model (DHSM), that builds upon the foundation of the Hybrid Strategy Model (HSM) technique [5,6]. Both the HSM and the DHSM are hybrid predictive contract techniques that dynamically select remote extrapolation models based on local evaluation of current entity dynamics.In this paper, we formalize the concept of the DHSM as a generalized framework for the reduction of network traffic in D...

show abstract

“…In this paper, we simply make use of the basic first order Dead Reckoning model. Further information on Dead Reckoning can be found in [2,10].…”

Section: A) Dead Reckoningmentioning

confidence: 99%

Using user perception to determine suitable error thresholds for dead reckoning in distributed interactive applications

Kenny

McLoone

Ward

et al. 2006

IET Irish Signals and Systems Conference (ISSC 2006)

View full text Add to dashboard Cite

__________________________________________________________________________________________Entity state update mechanisms are readily employed in Distributed Interactive Applications (DIAs), particularly in networked games. These mechanisms use prediction techniques in order to reduce the number of update packets sent across the network, while maintaining a high level of consistency from the remote user's point of view. These mechanisms only send update packets when the local user's actual behaviour differs from the predictive behaviour by a certain value, often referred to as the error threshold. In practice, this value is arbitrarily chosen and typically reflects what 'appears' to be suitable. It has been illustrated in various other media that psycho-perceptual measures can be used to greatly improve compression techniques, while maintaining satisfactory end-user experience. The best example of this is the MP3 compression used in audio. This paper describes a preliminary study designed to collect information relating to a subject's perception of a networked computer game. The main motivation behind this work is to investigate if psycho-perceptual measures can be used to obtain appropriate error threshold measures for entity state prediction mechanisms. Here, we employ Dead Reckoning as it is the simplest and most commonly used of these mechanisms in distributed gaming. The experiment outlined in this paper attempts to determine if an error threshold can be chosen from the users' perception, where user feedback is determined via linguistic variables. Furthermore, the effects of convergence, the speed of the entity and the shape of the entity trajectory are also examined from a psycho-perceptual viewpoint. The results are presented within.

show abstract

Accuracy in dead-reckoning based distributed multi-player games

Cited by 80 publications

References 7 publications

Timelines: simplifying the programming of lag compensation for the next generation of networked games

Timelines: simplifying the programming of lag compensation for the next generation of networked games

Formalizing a framework for dynamic hybrid strategy models in distributed interactive applications

Using user perception to determine suitable error thresholds for dead reckoning in distributed interactive applications

Contact Info

Product

Resources

About