Abstract
A novel framework to model and explore predictive contract mechanisms in distributed interactive applications (DIAs) using information theory is proposed. In our model, the entity state update scheme is modelled as an information generation, encoding, and reconstruction process. Such a perspective facilitates a quantitative measurement of state fidelity loss as a result of the distribution protocol. Results from an experimental study on a first-person shooter game are used to illustrate the utility of this measurement process. We contend that our proposed model is a starting point to reframe and analyse consistency maintenance in DIAs as a problem in distributed interactive media compression.
Highlights
Recent years have seen increasing interest in distributed interactive applications (DIAs)
Techniques used by these mechanisms can be classified into three classes [7]: information management techniques reduce the amount of data that has to be transmitted over the network; time management techniques manipulate time to mask the effect of network latency; system architecture techniques seek to improve the efficiency of processing and disseminating data
This paper has shown how, by employing information theory, entity state evolution can be viewed as an information generation process, and how predictive contract mechanisms can be modelled as a lossy information compression and reconstruction process
Summary
Recent years have seen increasing interest in distributed interactive applications (DIAs). We focus on one particular group of information management techniques, that is, predictive contract mechanisms that use prediction algorithms to reduce the number of update packets transmitted across the network. The local host only provides an approximated dynamic and encodes it in the ESUs. Predictive contract mechanisms sacrifice the accuracy of the remotely approximated dynamic in return for a reduction in the number of entity state updates and save bandwidth and reduce network latency. Predictive contract mechanisms sacrifice the accuracy of the remotely approximated dynamic in return for a reduction in the number of entity state updates and save bandwidth and reduce network latency The performances of such consistency maintenance mechanisms depend mainly on how much the prediction model perceptually matches the real motion of the object on the local host.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Games Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
