Fair and efficient dead reckoning-based update dissemination for distributed virtual environments

Due to diverse network latencies, participants in a Distributed Virtual Environment (DVE) may observe different inconsistency levels of the simulated virtual world, which can seriously affect fair competition among them. In this paper, we investigate how to disseminate Dead Reckoning (DR)-based upda...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Zengxiang, Tang, Xueyan, Cai, Wentong, Turner, Stephen John
Other Authors: School of Computer Engineering
Format: Conference or Workshop Item
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/101224
http://hdl.handle.net/10220/16767
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-101224
record_format dspace
spelling sg-ntu-dr.10356-1012242020-05-28T07:17:42Z Fair and efficient dead reckoning-based update dissemination for distributed virtual environments Li, Zengxiang Tang, Xueyan Cai, Wentong Turner, Stephen John School of Computer Engineering Workshop on Principles of Advanced and Distributed Simulation (26th : 2012 : Zhangjiajie, China) DRNTU::Engineering::Computer science and engineering Due to diverse network latencies, participants in a Distributed Virtual Environment (DVE) may observe different inconsistency levels of the simulated virtual world, which can seriously affect fair competition among them. In this paper, we investigate how to disseminate Dead Reckoning (DR)-based updates with the objectives of achieving fairness among participants and reducing inconsistency as much as possible. We first propose an optimized bandwidth allocation scheme for sending updates to overcome the drawbacks of uniform bandwidth allocation and the local-lag technique. Then, we integrate bandwidth allocation with an indirect relay method and develop algorithms to select relay routes for minimizing inconsistency under various bandwidth allocation schemes. Our proposed scheme and algorithms are evaluated using traces collected from a real car racing game as well as the real Internet latency data. The experimental results show that the proposed optimized bandwidth allocation scheme significantly reduces inconsistency while maintaining fairness among participants and that integrating the optimized scheme with our proposed relay setup algorithm further improves consistency. 2013-10-24T06:21:13Z 2019-12-06T20:35:22Z 2013-10-24T06:21:13Z 2019-12-06T20:35:22Z 2012 2012 Conference Paper Li, Z., Tang, X., Cai, W., & Turner, S. J. (2012). Fair and efficient dead reckoning-based update dissemination for distributed virtual environments. 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (PADS), pp.13-22. https://hdl.handle.net/10356/101224 http://hdl.handle.net/10220/16767 10.1109/PADS.2012.18 en
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering
spellingShingle DRNTU::Engineering::Computer science and engineering
Li, Zengxiang
Tang, Xueyan
Cai, Wentong
Turner, Stephen John
Fair and efficient dead reckoning-based update dissemination for distributed virtual environments
description Due to diverse network latencies, participants in a Distributed Virtual Environment (DVE) may observe different inconsistency levels of the simulated virtual world, which can seriously affect fair competition among them. In this paper, we investigate how to disseminate Dead Reckoning (DR)-based updates with the objectives of achieving fairness among participants and reducing inconsistency as much as possible. We first propose an optimized bandwidth allocation scheme for sending updates to overcome the drawbacks of uniform bandwidth allocation and the local-lag technique. Then, we integrate bandwidth allocation with an indirect relay method and develop algorithms to select relay routes for minimizing inconsistency under various bandwidth allocation schemes. Our proposed scheme and algorithms are evaluated using traces collected from a real car racing game as well as the real Internet latency data. The experimental results show that the proposed optimized bandwidth allocation scheme significantly reduces inconsistency while maintaining fairness among participants and that integrating the optimized scheme with our proposed relay setup algorithm further improves consistency.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Li, Zengxiang
Tang, Xueyan
Cai, Wentong
Turner, Stephen John
format Conference or Workshop Item
author Li, Zengxiang
Tang, Xueyan
Cai, Wentong
Turner, Stephen John
author_sort Li, Zengxiang
title Fair and efficient dead reckoning-based update dissemination for distributed virtual environments
title_short Fair and efficient dead reckoning-based update dissemination for distributed virtual environments
title_full Fair and efficient dead reckoning-based update dissemination for distributed virtual environments
title_fullStr Fair and efficient dead reckoning-based update dissemination for distributed virtual environments
title_full_unstemmed Fair and efficient dead reckoning-based update dissemination for distributed virtual environments
title_sort fair and efficient dead reckoning-based update dissemination for distributed virtual environments
publishDate 2013
url https://hdl.handle.net/10356/101224
http://hdl.handle.net/10220/16767
_version_ 1681056288137543680