Multidimensional query based routing for virtual environments

Authors:
Stevan Zonjic;Behnoosh Hariri;Shervin Shirmohammadi
Affiliations:
Distributed Collaborative Virtual Environments Research (DISCOVER) Lab, University of Ottawa, Canada;Distributed Collaborative Virtual Environments Research (DISCOVER) Lab, University of Ottawa, Canada and Advanced Communications Research Institute (ACRI), Sharif University of Technology, Iran;Distributed Collaborative Virtual Environments Research (DISCOVER) Lab, University of Ottawa, Canada
Venue:
VECIMS'09 Proceedings of the 2009 IEEE international conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems
Year:
2009

Citing 6
Cited 1

Accessing nearby copies of replicated objects in a distributed environment

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Multidimensional binary search trees used for associative searching

Communications of the ACM
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Multidimensional Binary Search Trees in Database Applications

IEEE Transactions on Software Engineering

Enhancement of Collaborative Interest Management Mechanism for P2P Networked Virtual Environment

PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.