Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments

Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments ELVIS S. LIU, IBM Research, Ireland, and University College Dublin GEORGIOS K. THEODOROPOULOS, Durham University Interest management in Distributed Virtual Environments (DVEs) is a data-filtering technique designed to reduce bandwidth consumption and therefore enhances the scalability of the system. This technique usually involves a process called interest matching, which determines what data should be sent to the participants as well as what data should be filtered. Although most of the existing interest matching approaches have been shown to meet their runtime performance requirements, they have a fundamental disadvantage--they perform interest matching at discrete time intervals. As a result, they would fail to report events between discrete timesteps. If participants of the DVE ignore these missing events, they would most likely perform incorrect simulations. This article presents a new approach called space-time interest matching, which aims to capture the missing events between discrete timesteps. Although this approach requires additional matching effort, a number of novel algorithms are developed to significantly improve its runtime efficiency. Categories and Subject Descriptors: I.6.7 [Simulation and Modeling]: Types of Simulation--Distributed; C.2.4 [Computer-Communication Networks]: Distributed System--Client/Server, Distributed Applications General Terms: Design, Algorithms, Performance Additional Key http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Modeling and Computer Simulation (TOMACS) Association for Computing Machinery

Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments

Loading next page...
 
/lp/association-for-computing-machinery/space-time-matching-algorithms-for-interest-management-in-distributed-Ws9V57FYRf
Publisher
Association for Computing Machinery
Copyright
Copyright © 2014 by ACM Inc.
ISSN
1049-3301
DOI
10.1145/2567922
Publisher site
See Article on Publisher Site

Abstract

Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments ELVIS S. LIU, IBM Research, Ireland, and University College Dublin GEORGIOS K. THEODOROPOULOS, Durham University Interest management in Distributed Virtual Environments (DVEs) is a data-filtering technique designed to reduce bandwidth consumption and therefore enhances the scalability of the system. This technique usually involves a process called interest matching, which determines what data should be sent to the participants as well as what data should be filtered. Although most of the existing interest matching approaches have been shown to meet their runtime performance requirements, they have a fundamental disadvantage--they perform interest matching at discrete time intervals. As a result, they would fail to report events between discrete timesteps. If participants of the DVE ignore these missing events, they would most likely perform incorrect simulations. This article presents a new approach called space-time interest matching, which aims to capture the missing events between discrete timesteps. Although this approach requires additional matching effort, a number of novel algorithms are developed to significantly improve its runtime efficiency. Categories and Subject Descriptors: I.6.7 [Simulation and Modeling]: Types of Simulation--Distributed; C.2.4 [Computer-Communication Networks]: Distributed System--Client/Server, Distributed Applications General Terms: Design, Algorithms, Performance Additional Key

Journal

ACM Transactions on Modeling and Computer Simulation (TOMACS)Association for Computing Machinery

Published: May 1, 2014

There are no references for this article.