An Evaluation of Push-Pull Algorithms in Support of Cell-Based Interest Management

Abstract

Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Responsibility for the entire space can then be distributed. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem, designed for use in cell-based systems in general.

On designing and testing distributed virtual environments

“…For example, microcells of custom size and shape add flexibility to adapt the load among machines dynamically [14]. A push-pull framework can be used to filter and reduce the number of messages exchanged between partitions [57]. Another variation, sharding, is a form of space partitioning where different users connect to different copies of parts of the space.…”