An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
Time-space consistency in large-scale distributed virtual environments
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Consistency models for distributed interactive multimedia applications
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
Advances in the multimedia and networking technologies allow the realization of the distributed virtual environment (DVE). DVE is a distributed system which allows many clients who are located in different locations (within a LAN or across a WAN) to concurrently explore and interact with each other in a high resolution, 3-dimensional graphical virtual environment. Some of the potential applications of DVE are: tele-conferencing, distributed games, distributed interactive simulation, collaborative group-ware environment, $\ldots$, etc. One challenging issue in designing a DVE is to guarantee that each participating client to have the same consistent view of the virtual world. To provide this consistent view, the DVE needs to perform synchronization actions periodically. In this paper, we present a methodology of deriving an optimal synchronizing interval. Our work is divided into two parts. In the first part, algorithms are presented to construct suitable communication sub-graph for the clients. In the second part, we present the outline on how to derive the optimal synchronizing interval based on the proposed communication sub-graph using the Markov chain theory and the fundamental matrix.