Npsnet

Macedonia, M.; Brutzman, Don; Zyda, Michael; Pratt, David R.; Barham, Paul T.; Falby, John S.; Locke, John

doi:10.1145/199404.199419

Cited by 60 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the viewpoint moves, the newly added visible objects must be incrementally updated and downloaded. AOI was first proposed by Macedonia et al [10] and is widely used for 3-D scene scheduling [11]- [13]. Wang et al [14] consider the view frustum and the distance from the viewpoint to divide the AOI into several sections with different download priorities.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient 3-D Scene Prefetching From Learning User Access Patterns

Zhou

Chen

Zhang

2015

IEEE Trans. Multimedia

View full text Add to dashboard Cite

Rendering large-scale 3-D scenes on a thin client is attracting increasing attention with the development of the mobile Internet. Efficient scene prefetching to provide timely data with a limited cache is one of the most critical issues for remote 3-D data scheduling in networked virtual environment applications. Existing prefetching schemes predict the future positions of each individual user based on user traces. In this paper, we investigate scene content sequences accessed by various users instead of user viewpoint traces and propose a user access pattern-based 3-D scene prefetching scheme. We make a relationship graph-based clustering to partition history user access sequences into several clusters and choose representative sequences from among these clusters as user access patterns. Then, these user access patterns are prioritized by their popularity and users' personal preference.Based on these access patterns, the proposed prefetching scheme predicts the scene contents that will most likely be visited in the future and delivers them to the client in advance. The experiment results demonstrate that our user access pattern-based prefetching approach achieves a high hit ratio and outperforms the prevailing prefetching schemes in terms of access latency and cache capacity.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Based on the popularity of access patterns and the personal preferences of users, we combine and to define the interest priority for each pattern. The interest priority of access pattern for user is given by (10) where indicates which factor (popularity or personal preference) contributes more to the priority.…”

Section: User Access Pattern Prioritymentioning

confidence: 99%

Efficient 3-D Scene Prefetching From Learning User Access Patterns

Zhou

Chen

Zhang

2015

IEEE Trans. Multimedia

View full text Add to dashboard Cite

show abstract

“…The result is particularly interesting in the sense that the storage server can provide a guarantee for timely data retrieval for different multimedia applications, which may have vastly different quality of service requirements. In [24], the authors demonstrated how to build a distributed virtual environment for military applications and showed how it can be used to support hundreds of users. In [8], the authors designed a prototype DVE system which operates based on the Internet IP Protocol [9].…”

Section: Introductionmentioning

confidence: 99%

An efficient partitioning algorithm for distributed virtual environment systems

Lui

Chan²

2002

IEEE Trans. Parallel Distrib. Syst.

177

118

View full text Add to dashboard Cite

AbstractÐDistributed virtual environment (DVE) systems model and simulate the activities of thousands of entities interacting in a virtual world over a wide area network. Possible applications for DVE systems are multiplayer video games, military and industrial trainings, and collaborative engineering. In general, a DVE system is composed of many servers and each server is responsible to manage multiple clients who want to participate in the virtual world. Each server receives updates from different clients (such as the current position and orientation of each client) and then delivers this information to other clients in the virtual world. The server also needs to perform other tasks, such as object collision detection and synchronization control. A large scale DVE system needs to support many clients and this imposes a heavy requirement on networking resources and computational resources. Therefore, how to meet the growing requirement of bandwidth and computational resources is one of the major challenges in designing a scalable and cost-effective DVE system. In this paper, we propose an efficient partitioning algorithm that addresses the scalability issue of designing a large scale DVE system. The main idea is to dynamically divide the virtual world into different partitions and then efficiently assign these partitions to different servers. This way, each server will process approximately the same amount of workload. Another objective of the partitioning algorithm is to reduce the server-to-server communication overhead. The theoretical foundation of our dynamic partitioning algorithm is based on the linear optimization principle. We also illustrate how one can parallelize the proposed partitioning algorithm so that it can efficiently partition a very large scale DVE system. Lastly, experiments are carried out to illustrate the effectiveness of the proposed partitioning algorithm under various settings of the virtual world.

show abstract

Balancing Workload and Communication Cost for a Distributed Virtual Environment

Lui

Chan

et al. 1998

Advances in Multimedia Information Systems

View full text Add to dashboard Cite

Npsnet

Cited by 60 publications

References 4 publications

Efficient 3-D Scene Prefetching From Learning User Access Patterns

Efficient 3-D Scene Prefetching From Learning User Access Patterns

An efficient partitioning algorithm for distributed virtual environment systems

Balancing Workload and Communication Cost for a Distributed Virtual Environment

Contact Info

Product

Resources

About