A hybrid motion prediction method for caching and prefetching in distributed virtual environments

Chan, Alan H. S.; Lau, Rynson W. H.; Ng, Beatrice

doi:10.1145/505032.505035

Cited by 8 publications

(11 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…At high velocity motion, we use an elliptic model for prediction. To improve the accuracy of the prediction, we also consider the user's motion characteristics [Chan et al 2001b]. Having predicted the mouse motion, we can estimate the viewer's future position and viewing angle.…”

Section: Introductionmentioning

confidence: 99%

Motion prediction for caching and prefetching in mouse-driven DVE navigation

Chan

Lau

2005

ACM Trans. Internet Technol.

Self Cite

View full text Add to dashboard Cite

A distributed virtual environment (DVE) allows geographically separated users to participate in a shared virtual environment via connected networks. However, when the users are connected by the Internet, bandwidth limitation and network latency may seriously affect the performance and the interactivity of the system. This explains why there are very few DVE applications for the Internet. To address these shortcomings, caching and prefetching techniques are usually employed. Unfortunately, the effectiveness of these techniques depends largely on the accuracy of the prediction method used. Although there are a few methods proposed for predicting 3D motion, most of them are primarily designed for predicting the motion of specific objects by assuming certain object motion behaviors. We notice that in desktop DVE applications, such as virtual walkthrough and network gaming, the 2D mouse is still the most popular device used for navigation input. Through studying the motion behavior of a mouse during 3D navigation, we have developed a hybrid motion model for predicting the mouse motion during such navigation-a linear model for prediction at low-velocity motion and an elliptic model for prediction at high-velocity motion. The predicted mouse motion velocity is then mapped to the 3D environment for predicting the user's 3D motion. We describe how this prediction method can be integrated into the caching and prefetching mechanisms of our DVE prototype. We also demonstrate the effectiveness of the method and the resulting caching and prefetching mechanisms through extensive experiments.

show abstract

Section: Introductionmentioning

confidence: 99%

Motion prediction for caching and prefetching in mouse-driven DVE navigation

Chan

Lau

2005

ACM Trans. Internet Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Given the same network condition, the interactive performance the three rendering modes can be ranked as: Double warping > Single warping > Image streaming 1 . The rendering server runs on a workstation that has an AMD Phenom II 3.2GHz quad-core CPU, 4GB memory, an Nvidia GeForce 9800GT GPU, and connects to the Gbps ethernet university network.…”

Section: Discussionmentioning

confidence: 99%

Distortion over latency: Novel metric for measuring interactive performance in remote rendering systems

Shi

Nahrstedt

Campbell

2011

2011 IEEE International Conference on Multimedia and Expo

View full text Add to dashboard Cite

A new metric distortion over latency (DOL) is proposed in this paper to overcome the deficiency of the traditional metric interaction latency in measuring the interactive performance of the modern remote rendering systems, which are enhanced with different latency reduction techniques. The proposed metric is novel in combining both latency and rendering quality into one score for measurement. Our experiments validate that in many scenarios, our new metric can effectively distinguish the performance difference between systems while interaction latency can not. The paper also introduces how DOL can be efficiently calculated at runtime.

show abstract

“…In this article, we advocate to use the two methods as an integral scheme to conduct cache in a MP2P network. There are also related problems including prediction, synchronization and multi-server support that need to be considered [3,10,11].…”

Section: Cache Updatementioning

confidence: 99%

Benefit based cache data placement and update for mobile peer to peer networks

Chen

2010

World Wide Web

View full text Add to dashboard Cite

Mobile Peer to Peer (MP2P) networks provide decentralization, selforganization, scalability characters, but suffer from high latency and link break problems. In this paper, we study the cache/replication placement and cache update problems arising in such kind of networks. While researchers have proposed various replication placement algorithms to place data across the network to address the problem, it was proven as NP-hard. As a result, many heuristic algorithms have been brought forward for solving the problem. In this article, we propose an effective and low cost cache placement strategy combined with an update scheme which can be easily implemented in a decentralized way. The contribution of this paper is the adaptive and flexible cache placement and update algorithms designed for real MP2P network usage. The combination of MP2P cache placement and update is the novelty of this article. Extensive experiments are conducted to demonstrate the efficiency of the cache placement and update scheme.

show abstract

A hybrid motion prediction method for caching and prefetching in distributed virtual environments

Cited by 8 publications

References 0 publications

Motion prediction for caching and prefetching in mouse-driven DVE navigation

Motion prediction for caching and prefetching in mouse-driven DVE navigation

Distortion over latency: Novel metric for measuring interactive performance in remote rendering systems

Benefit based cache data placement and update for mobile peer to peer networks

Contact Info

Product

Resources

About