SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Stochastic processes
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Implicitly Scalable, Fully Interactive Multimedia Storage Server
DIS-RT '98 Proceedings of the Second International Workshop on Distributed Interactive Simulation and Real-Time Applications
Using a Position History-Based Protocol for Distributed Object Visualization
Using a Position History-Based Protocol for Distributed Object Visualization
The rise of shared virtual environments
IEEE Spectrum
IEEE Spectrum
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
On consistency and network latency in distributed interactive applications: a survey--part I
Presence: Teleoperators and Virtual Environments
Presence: Teleoperators and Virtual Environments
A two-phase approach to interactivity enhancement for large-scale distributed virtual environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards an information model of consistency maintenance in distributed interactive applications
International Journal of Computer Games Technology - Networking for Computer Games
PADS '09 Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
Hierarchical interest management for distributed virtual environments
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
| Hi-index | 0.00 |
In this paper, we consider problems of constructing a communication subgraph and deriving an optimal synchronization interval for a distributed virtual environment system (DVE). In general, a DVE system is a distributed system which allows many clients who are located in different parts of the network to concurrently explore and interact with each other under a high resolution, 3D, graphical virtual environment. Each client in a DVE system is represented by an avatar in the virtual environment, and each avatar can move and interact freely in the virtual environment. There are many challenging issues in designing a cost-effective DVE system. In this work, we address two important design issues, namely: 1) how to construct a communication subgraph which can efficiently carry traffic generated by all clients in a DVE system, and 2) how to guarantee that each participating client has the same consistent view of the virtual world. In other words, if there is an action taken by an avatar or if there is any change in the state of an object in the virtual world, every participating client will be able to view the change. To provide this consistent view, a DVE system needs to perform synchronization actions periodically. We present several algorithms for constructing a communication subgraph. In the subgraph construction, we try to reduce the consumption of network bandwidth resources or reduce the maximum delay between any two clients in a DVE system. Based on a given communication subgraph, we then derive the optimal synchronization interval so as to guarantee the view consistency among all participating clients. The derivation of the optimal synchronization interval is based on the theory of Markov chains and the fundamental matrix.