2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications最新文献

筛选
英文 中文
Statemachine Matching in BOM Based Model Composition 基于BOM的模型组合中的状态机匹配
Imran Mahmood, R. Ayani, Vladimir Vlassov, F. Moradi
{"title":"Statemachine Matching in BOM Based Model Composition","authors":"Imran Mahmood, R. Ayani, Vladimir Vlassov, F. Moradi","doi":"10.1109/DS-RT.2009.19","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.19","url":null,"abstract":"Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simulation process. Composing predefined components such as BOMs is a well known approach to achieve reusability. However, there is a need for a matching mechanism to identify whether a set of components are composable or not. Although BOM provides good model representation, it lacks capability to express semantic and behavioral matching.In this paper we propose an approach for matching behavior of BOM components by matching their statemachines. Our proposed process includes a static and a dynamic matching phase. In the static matching phase, we apply a set of rules to validate the structure of statemachines. In the dynamic matching phase, we execute the statemachines together at an abstract level on our proposed execution framework. We have developed this framework using the State Chart Extensible Markup Language (SCXML), which is a W3C compliant standard. If the execution terminates successfully (i.e. reaches specified final states) we conclude that there is a positive match and the behavior of these BOMs is composable. We describe the matching process and the implementation of our runtime environment in detail and present a case study as proof of concept.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114290755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Distributed Simulation of RePast Models over HLA/Actors HLA/Actors上RePast模型的分布式仿真
F. Cicirelli, A. Furfaro, Andrea Giordano, L. Nigro
{"title":"Distributed Simulation of RePast Models over HLA/Actors","authors":"F. Cicirelli, A. Furfaro, Andrea Giordano, L. Nigro","doi":"10.1109/DS-RT.2009.14","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.14","url":null,"abstract":"This paper reports about a research project-HLA ACTOR REPAST- aimed to distributing RePast modelsthus potentially corresponding to the computational demandsof large and reconfigurable multi-agent systems (MASs). Novelin HLA ACTOR REPAST is an exploitation of a lean actorinfrastructure implemented in Java. Actors bring to RePastagents such features as migration, location-transparent naming,efficient communications, and a control-centric framework.Actors can be orchestrated by an in-the-large custom controlstructure which can ensure the necessary message causalityconstraints. Distribution and time management concerns dependon the IEEE standard HLA middleware. The paper first discussesdetails of the software engineering process underlyingHLA ACTOR REPAST. The mapping techniques, based on Javatext annotations and aspect oriented programming, minimize“code intrusions” in the original model. Then the paper describessome experiments and performance results of applyingHLA ACTOR REPAST to a distributed version of a RePastTileworld model.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132171824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A Context-Driven Framework for Distributed Collaboration 分布式协作的上下文驱动框架
A. Sabbir, K. Ravindran
{"title":"A Context-Driven Framework for Distributed Collaboration","authors":"A. Sabbir, K. Ravindran","doi":"10.1109/DS-RT.2009.37","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.37","url":null,"abstract":"A key requirement for a distributed collaborative application is that all participants see the same copy of a shared window-object at different points in time (WYSIWIS). This is needed to maintain a cohesive view of the problem. We recognize that user actions are generated based on their understanding of the context of the problem, where context is defined in terms global view of the shared window object. However, it is noted that, actions generated from different sites in response to the same context may not be compatible with each other since execution of one action may change the context in such a way that other actions become irrelevant. This notion of compatibility of action is the crucial distinguishing factor between a distributed collaborative system and other distributed systems where independent actions are generally serializable [1]. We propose a general framework that uses the concept of temporal epoch to implement a state-machine model of collaboration. We also explore the idea of ‘contextual integrity’ as a pre-requisite for perceptual consistency among users.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121303788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Synchronised Range Queries 同步范围查询
Vinoth Suryanarayanan, Rob Minson, G. Theodoropoulos
{"title":"Synchronised Range Queries","authors":"Vinoth Suryanarayanan, Rob Minson, G. Theodoropoulos","doi":"10.1109/DS-RT.2009.31","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.31","url":null,"abstract":"In this paper, we present and evaluate a system for performing logical-time synchronised Range Queries over data in the context of parallel and distributed simulations of Multi-Agent Systems (MAS). MAS are often extremely complex and simulation is commonly used to understand their behaviour or investigate the implications of alternative agent architectures. Range Queries are widely used in various fields such as Peer to Peer systems, Wireless communications or Database systems. They are key to many MAS models as they are commonly used to represent the spatial perceptive abilities of the agents in the MAS. PDES-MAS (Parallel and Discrete Event Simulation for Multi-Agent Systems) is a decentralised, discrete event simulation (DES) system which can be used to distribute and run a large scale MAS simulation over a parallel computation architecture. This paper presents a design for Logical-Time synchronised Range Queries and the implementation and evaluation of this design within the PDES-MAS system.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124626415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Improving Time Parallel Simulation for Monotone Systems 改进单调系统的时间并行仿真
J. Fourneau, I. Kadi, N. Pekergin
{"title":"Improving Time Parallel Simulation for Monotone Systems","authors":"J. Fourneau, I. Kadi, N. Pekergin","doi":"10.1109/DS-RT.2009.16","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.16","url":null,"abstract":"We improve the efficiency of time parallel simulation using some concepts of monotonicity of simulation models. The time parallel simulation technique partitions the simulation timespan into simulation periods which are independently executed. Such a technique relies on strong stochastic assumptions: regeneration or short influence of the initial point a on sample path. If these assumptions are not satisfied, we only obtain an approximation. We prove that if the model is monotone we can increase the parallelization of the simulations and we can prove some bounds on the result.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115285880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Joint Hierarchical Nodes Based User Management (JoHNUM) Infrastructure for the Development of Scalable and Consistent Virtual Worlds 基于联合分层节点的用户管理(JoHNUM)基础设施,用于开发可扩展和一致的虚拟世界
U. Farooq, J. Glauert
{"title":"Joint Hierarchical Nodes Based User Management (JoHNUM) Infrastructure for the Development of Scalable and Consistent Virtual Worlds","authors":"U. Farooq, J. Glauert","doi":"10.1109/DS-RT.2009.32","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.32","url":null,"abstract":"Virtual Environments (VEs) have recently gained a lot of attention from the Computing, Graphics, Business and Social communities due to a remarkable increase in their popularity. These communities are working together to make these environments more sociable and interesting while introducing novel applications. A number of technical infrastructures are currently hosting these environments, however, Client Multi Server (CMS) infrastructures are considered best for their flexibility. Scalability and consistency are basic issues in developing large scale Distributed Virtual Environments (DVEs) that require special attention. The existing mechanisms have major performance issues, and therefore, more sophisticated infrastructures are required to deal with dynamic requirements of the applications. In this paper, we propose a novel Joint Hierarchical Nodes based User Management (JoHNUM) infrastructure for the development of scalable and consistent virtual worlds. It is compared with the game middleware, Matrix, for evaluation purposes that has demonstrated better performance over the existing static mechanisms. Simulation results show that JoHNUM achieves lower levels Resource Management Tree (RMT) and increases user interactive experience. Moreover, it uses fewer resources and minimizes communication overhead, almost the same as Matrix.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115380954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
A Simulation Study of Exit Choice Based on Effective Throughput of an Exit Area in a Multi-exit Evacuation Situation 多出口疏散情况下基于有效吞吐量的出口选择仿真研究
K. Zia, A. Ferscha
{"title":"A Simulation Study of Exit Choice Based on Effective Throughput of an Exit Area in a Multi-exit Evacuation Situation","authors":"K. Zia, A. Ferscha","doi":"10.1109/DS-RT.2009.13","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.13","url":null,"abstract":"To individuals evacuating, many multi-exit environments do not allow visibility of all the exits due to line-of-sight constraint. In addition, the environment can be dark or smoky, not allowing visibility to even a single exit. In such a situation, given that each individual in the crowd is accompanied with a helping device globally connected with a central server, a 'directional guidance' towards an optimal exit is a real possibility. In this context, the 'occupant density' around exits (within a static ‘exit area’) has been used in conjunction with the corresponding distances to devise a probabilistic strategy for optimal exit suggestion [1]. In this paper, we related the exit area with the level of visibility of the environment (the more the visibility, the more the exit area and vice versa). In this way, a more realistic human-behavioral model is implemented in which an individual viewing (seeing) an exit would always direct towards that exit, irrespective of the directional guidance provided. When an individual is not at any of the exit areas (not viewing even a single exit), a directional guidance is provided assuming that the individual is adhering to it. Additionally we used the measure of 'effective throughput' instead of occupant density, in conjunction with the corresponding distances. Through simulation results, we found a marked improvement in the evacuation time, when effective throughput was modeled instead of occupant density.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115577358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Scenario-Based Diameter-Bounded Algorithm for Cluster Creation and Management in Mobile Ad hoc Networks 移动Ad hoc网络中基于场景的集群创建与管理的直径有界算法
V. Anitha, M. Sebastian
{"title":"Scenario-Based Diameter-Bounded Algorithm for Cluster Creation and Management in Mobile Ad hoc Networks","authors":"V. Anitha, M. Sebastian","doi":"10.1109/DS-RT.2009.28","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.28","url":null,"abstract":"The construction of stable and adaptive clusters providing good performance and faster convergence rate with minimal overhead is a challenging task in Mobile Ad hoc Networks (MANETs). This paper proposes a clustering technique for MANETs, which is distributed, dominating set based, weighted and adaptive to changes in the topology called Distributed Scenario-based Clustering Algorithm for Mobile ad hoc networks (DSCAM). The election of clusterheads and gateway nodes is based on (k, r) − Dominating set, where k s the minimum number of clusterheads per node in the network and r is the maximum number of hops between a node and its clusterhead. After selecting clusterheads, affiliation of other nodes with the clusterhead is decided based on the quality of clusterhead, which is a function of connectivity, stability, residual battery power and transmission rate. Among the k dominating nodes, non clusterhead nodes select the most qualified node as its clusterhead. DSCAM creates stable clusters with less overhead and maximizes the life span of the network. The performance of this algorithm is evaluated through simulation and the results are encouraging.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132896517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
EDEVS : A Scalable DEVS Formalism for Event-Scheduling Based Parallel and Distributed Simulations EDEVS:基于事件调度的并行和分布式仿真的可扩展DEVS形式
Gang Liu, Yiping Yao, Shaoliang Peng
{"title":"EDEVS : A Scalable DEVS Formalism for Event-Scheduling Based Parallel and Distributed Simulations","authors":"Gang Liu, Yiping Yao, Shaoliang Peng","doi":"10.1109/DS-RT.2009.27","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.27","url":null,"abstract":"Scalability is very important for parallel and distributed simulations. Several techniques have been proposed to develop scalable synchronization strategies, communication services or fundamental algorithms, while little has been seen to deal with the modeling stage of the application. Learning from the HPC (High Performance Computing) lesson, it is clear that the time spent in developing a simulation application must be considered in evaluating the scalability of the application. There are many discrete event simulation platforms built for large parallel and distributed simulations, such as SPEEDES (Synchronous Parallel Environment for Emulation and Discrete Event Simulation), GTW (Georgia tech Time Warp), and YHSUPE, etc. They take Event-Scheduling as their modeling paradigm and have achieved great runtime performance, but lack in providing efficient modeling methods. To deal with this issue, a component-based specification, which can support hierarchical decomposition of large models and facilitate model reuse, is presented. This paper extends the DEVS (Discrete Event simulation specification) and proposes a component-based formalism, called EDEVS (Event-Scheduling Discrete Event simulation Specification) for the existing Event-Scheduling parallel and distributed simulation platforms.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116147721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
DEVS/SOA: Towards DEVS Interoperability in Distributed M&S DEVS/SOA:在分布式M&S中实现DEVS互操作性
A. Moreno, J. L. Risco-Martín, E. Besada-Portas, S. Mittal, J. Almansa
{"title":"DEVS/SOA: Towards DEVS Interoperability in Distributed M&S","authors":"A. Moreno, J. L. Risco-Martín, E. Besada-Portas, S. Mittal, J. Almansa","doi":"10.1109/DS-RT.2009.18","DOIUrl":"https://doi.org/10.1109/DS-RT.2009.18","url":null,"abstract":"DEVS Modeling and Simulation (M&S) has multiple implementations with several computer languages such asJava, C# or C++. Therefore emerges the need of a distributed platform to provide interoperability mechanics for simulationand encourage reusability of legacy simulations and integration of diversified DEVS models. In this paper, we apply a recentlyproposed interoperability standard for DEVS M&S throughout a renewed version of DEVS/SOA. The main goal of thisweb oriented framework is to connect heterogeneous DEVS simulation elements in a transparent, open, and scalable way.We define a DEVS/SOA implementation that embodies Service Oriented Architecture (SOA) within WSDL standard to describethe simulator and coordinator interfaces and SOAP standard to support communication operations between them. This arrangementallows frontend user applications to lead simulations without local access to modeling components. Furthermore, weillustrate a real military based example of DEVS simulation interoperability among Java and .NET based DEVS models.Experiments in two different examples show that when the simulation is distributed using DEVS/SOA, we obtain a speedup of 22% in average.","PeriodicalId":225513,"journal":{"name":"2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127532099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信