Publication
DS-RT 2011
Conference paper

A parallel interest matching algorithm for distributed-memory systems

View publication

Abstract

As the scale of Distributed Virtual Environments (DVEs) grows in terms of participants and virtual entities, using interest management schemes to reduce bandwidth consumption becomes increasingly common for DVE development. The interest matching process is essential for most of the interest management schemes which determines what data should be sent to the participants as well as what data should be filtered. However, if the computational overhead of interest matching is too high, it would be unsuitable for real-time DVEs for which runtime performance is important. This paper presents a new approach of interest matching which divides the workload of matching process among a cluster of computers. Experimental evidence shows that our approach is an effective solution for the real-time applications. © 2011 IEEE.

Date

04 Sep 2011

Publication

DS-RT 2011

Authors

Topics

Share