Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
MASSIVE: a collaborative virtual environment for teleconferencing
ACM Transactions on Computer-Human Interaction (TOCHI) - Special issue on virtual reality software and technology
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Exploiting Reality with Multicast Groups
IEEE Computer Graphics and Applications
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
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic Grid-Based Multicast Group Assignment in Data Distribution Management
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Enabling Flexible Queries with Guarantees in P2P Systems
IEEE Internet Computing
Game traffic analysis: an MMORPG perspective
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
A synthetic traffic model for Quake3
Proceedings of the 2004 ACM SIGCHI International Conference on Advances in computer entertainment technology
An Adaptive Interest Management Scheme for Distributed Virtual Environments
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
Range Queries in Trie-Structured Overlays
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
A distributed event delivery method with load balancing for MMORPG
NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
Traffic characteristics of a massively multi-player online role playing game
NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
Adaptive Interest Management via Push-Pull Algorithms
DS-RT '06 Proceedings of the 10th IEEE international symposium on Distributed Simulation and Real-Time Applications
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
An Evaluation of Push-Pull Algorithms in Support of Cell-Based Interest Management
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Load Skew in Cell-Based Interest Management Systems
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Autonomic microcell assignment in massively distributed online virtual environments
Journal of Network and Computer Applications
Synchronised range queries in distributed simulations of multiagent systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Interest management for distributed virtual environments: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
In many real time interactive simulations the problem of interest management is that of filtering updates through application-specified range queries. This "associative' form of memory access is often implemented more simply as a reference memory access pattern by discretising the n- Dimensional space in to "cells'. Range queries then being mapped on to this discretised form. In this paper we leverage previous work on optimising communication in reference memory access systems to provide the same optimisation to associative memory access systems. We define possible semantics of range queries and present three designs along with an analysis of the problem in various applications domains and a discussion of the viability of our designs for each problem domain.