Multidimensional Query Based Routing for Virtual Environments

被引：2

作者：

Zonjic, Stevan ^{[1
]}

Hariri, Behnoosh ^{[1
]}

Shirmohammadi, Shervin ^{[1
]}

机构：

[1] Univ Ottawa, Distributed Collaborat Virtual Environm Res DISCO, Ottawa, ON K1N 6N5, Canada

来源：

2009 IEEE INTERNATIONAL CONFERENCE ON VIRTUAL ENVIRONMENTS, HUMAN-COMPUTER INTERFACES AND MEASUREMENT SYSTEMS | 2009年

关键词：

Virtual Environments; Massively MultiuserRoutiug; KD-Tree;

D O I：

10.1109/VECIMS.2009.5068875

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we propose a new architecture based on Z-order curve and kd-tree that can efficiently handle issues related to update messages distribution to interested entities' locations in a three-dimensional (3D) virtual environments where locations are described in terms of 3D coordinates. We also aim to minimize the number of routing hops in distribution of update messages, especially when updates are forwarded to a specific range of users/entities in the virtual environment. Our results are promising and show improvements in both of the objectives.

引用

页码：107 / 112

页数：6

共 8 条

[1] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING
BENTLEY, JL
[J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517
[2] BENTLEY JL, 1979, IEEE T SOFTWARE ENG, V5
[3] Friedman J. H., 1977, ACM Transactions on Mathematical Software, V3, P209, DOI 10.1145/355744.355745
[4] HARIRI B, 2008, IEEE INT WORKSH HAPT
[5] LAWDER JK, 2000, USING SPACE FILLING
[6] PLAXTON CG, 1997, P 9 ANN ACM S PAR AL, P311, DOI DOI 10.1145/258492.258523
[7] Rowstron A., 2001, IFIP ACM INT C DISTR
[8] ZHAO BY, 2001, UCBCSD011141 U CAL B

← 1 →