An Effective Aggregation Method in Distributed Virtual Environments

Ji Ming Chen; Zhi Wen Zou; Jin Gui Pan; Yuan Hao Sun

doi:10.4028/www.scientific.net/AMR.187.475

Paper Titles

Multi-Person Tracking Based on Video Information Fusion
p.452

Patent Classification Using Hybrid Classifier Systems
p.458

Nonlinear Analysis of Traffic Flow for a Lattice Model in an Intelligent Transportation Environment
p.464

Survey and Analysis of Teacher-Resources of Normal Physical Department Equipped in Colleges in Tianjin
p.469

An Effective Aggregation Method in Distributed Virtual Environments
p.475

Study on Match Strategy in Badminton Group Competition
p.480

Some Properties of Symplectic Manifolds S on the Projective Tangent Bundle PTM
p.483

The Analysis on the Conditions and its Causes of Sports Ground in Xinjiang
p.487

A Model of Jointly Managed Inventory Simulation in the Steel Market's ERP System
p.492

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 187An Effective Aggregation Method in Distributed...

An Effective Aggregation Method in Distributed Virtual Environments

Abstract:

The aggregation problem of the interest expressions is an important problem in distributed virtual environment (DVE). According to the characteristic of DVE system, a new aggregation method is proposed in this paper, which uses hierarchical bounding volume to aggregate threshold predicate and TAG-ID/MASK to aggregate equivalent predicate separately. Experimental results show that this method can effectively reduce storage of interest expressions and highly improve the system’s scalability.

You might also be interested in these eBooks

Sport Materials, Modelling and Simulation

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 187)

Pages:

475-479

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.187.475

Citation:

Cite this paper

Online since:

February 2011

Authors:

Ji Ming Chen, Zhi Wen Zou, Jin Gui Pan, Yuan Hao Sun

Keywords:

Aggregation Method, Distributed Virtual Environment, Equivalent Predicate, Threshold Predicate

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Yuan Hong Liang, Shi Dian Xi, Wang Huai Ming, et al. Research on Routing Algorithm Based on Subscription Covering in Content-Based Publish/Subscribe. Chinese Journal of Computers, (2006).

Google Scholar

[2] Z H Shen, S Tirthapura, and S Aluru. Indexing for subscription covering in publish-subscribe systems. In Proc. IEEE International Conference on Data Engineering . Tokyo, IEEE Computer Society, pp.32-43, (2005).

Google Scholar

[3] Zabele S, Dorsch M, Ge Z, etal. SANDS: Specialized Active Networking for Distributed Simulation. In: Proc. of the DARPA Active Networks Conference and Exposition. Washington, DC, IEEE Computer Society, (2002).

DOI: 10.1109/dance.2002.1003507

Google Scholar

[4] T. Wong, R. Katz and S. McCanne, An Evaluation of PreferenceClustering in Large-ScaleMulticast Applications, IEEE Infocom, Tel Aviv, (2000).

Google Scholar

[5] G. Banavar, T. Chandra, B. Mukherjee, J. Nagarajarao, R. Strom and D. Sturman, An Efficient Multicast Protocolfor Content-Based Publish-Subscribe Systems, International Conference on Distributed Computing Systems, (2006).

DOI: 10.1109/icdcs.1999.776528

Google Scholar

[6] J. B. Kruskal, On the shortest spanning subtree of a graph andthe traveling salesman problem., Proceedings of the AMS, (1996).

Google Scholar