IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v6y2012i3p164-178.html
   My bibliography  Save this article

Loss-aware DR-based update scheduling for improving consistency in DVEs

Author

Listed:
  • Z Li
  • W Cai
  • X Tang
  • S Zhou

Abstract

Maintaining a consistent presentation of the virtual world among participants is a fundamental problem in the distributed virtual environment. The problem is exacerbated due to the limited network bandwidth and error-prone transmission. Using the metric of time-space inconsistency (TSI), we analytically derive the impact of message loss on TSI when using a dead reckoning (DR)-based update mechanism. To improve consistency, a naive algorithm and a compensation algorithm for update scheduling are proposed, in which expected spatial difference and expected TSI are, respectively, calculated by taking message loss into account. Using these algorithms, a budget-based mechanism is developed to meet the network bandwidth constraint. We show through experiments using a racing car game that the budget-based mechanism using the compensation algorithm makes the best use of available network bandwidth to reduce the inconsistency and its impact on the participants, and ensures fairness among participants in spite of widely varying message loss rates.

Suggested Citation

  • Z Li & W Cai & X Tang & S Zhou, 2012. "Loss-aware DR-based update scheduling for improving consistency in DVEs," Journal of Simulation, Taylor & Francis Journals, vol. 6(3), pages 164-178, August.
    • Handle: RePEc:taf:tjsmxx:v:6:y:2012:i:3:p:164-178
    DOI: 10.1057/jos.2012.3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/jos.2012.3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jos.2012.3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjsmxx:v:6:y:2012:i:3:p:164-178. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.