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

{"title":"AmI Technology Helps to Sustain Speed While Merging - A Data Driven Simulation Study on Madrid Motorway Ring M30","authors":"A. Riener, K. Zia, A. Ferscha, C. B. Ruiz, J. J. M. Rubio","doi":"10.1109/DS-RT.2010.21","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.21","url":null,"abstract":"A considerable increase in road traffic has provoked a total change in the operating paradigms of vehicles, shifting vehicle handling from “just steering” towards a complex adaptation task. With the emergence of wireless communication technology, vehicle operation can now incorporate for the first time ever beside the local driver-vehicle interaction also more significant information obtained from cars in the surrounding. With this foundation it would be possible to build collectively operating driver assistance systems, negotiating the interests of all road participants in a certain area with the final goal to improve global parameters such as road throughput or traffic fluidity, also having an effect on the individual car (driver), e. g. increased travel speed, less congestions, or a reduced level of cognitive load. The question addressed with this paper is whether or not the vehicle speed can be sustained while merging onto a motorway, leading to a more harmonious integration of the merging cars into the flowing traffic on the main road. To achieve this we propose the application of ambient intelligence (AmI) technology operating on the collective behavior of all cars in the periphery of the entrance ramp. To prove our hypothesis we applied the AmI technology to a data driven, true to scale simulation model of the Madrid motorway M30, one of the most busiest roads in Spain. The comparison of simulation runs with high volume of traffic showed that technology assistance could help to increase road throughput and minimize the variance of traffic flow, but on the other side demands solutions for one of the bigger problems of data driven simulation – missing or noisy data compromising simulation results.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124183072","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}

{"title":"Scenario Based Modeling for Very Large Scale Simulations","authors":"K. Zia, A. Ferscha, A. Riener, M. Wirz, D. Roggen, Kamil Kloch, P. Lukowicz","doi":"10.1109/DS-RT.2010.20","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.20","url":null,"abstract":"In order to develop complexity science based modeling, prediction and simulation methods for large scale socio-technical systems in an Ambient Intelligence (AmI) based smart environment, we propose a scenario based modeling approach. With a case study on AmI technology to support the evacuation from emergency scenarios, i.e. the Life Belt, a wearable computing systems for vibro-tactile directional guidance, we introduce the concept of model scaling from a micro to a macro level. Aligned with the scenario, we present how crowd simulation strategies encoded into a small scale simulation setup can be extended to a mixed-level simulation based on combining model aspects also coming from the large scale model. The experimental results of a real evacuation trail at a local railway station are incorporated to compare the evacuation efficiency for three strategies: (i) Potential Map, (ii) Evacuees familiarity of the exits and (iii) Exits usage optimization. A comparison with the earlier results from small scale simulation suggest that a real large scale simulation results may not be similar to that of small scale simulation due to dynamics of crowd built up and complexity of building structure.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127510375","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}

{"title":"Studying Characteristics of an Emulab Testbed for Scientifically Rigorous Experiments","authors":"A. Perez-Garcia, C. Siaterlis, M. Masera","doi":"10.1109/DS-RT.2010.33","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.33","url":null,"abstract":"Emulation test beds are increasingly used to study the Internet. In this paper we briefly review various characteristics of a test bed based on the Emulab software that are necessary to conduct scientifically rigorous experiments: experiment fidelity and repeatability as well as measurement accuracy and interference. Our results indicate that the current trend of using emulation test beds is justified as both realistic and efficient. We show that Emulab-based configurations are representative of real systems in terms of emerging behavior (qualitative) and that repeatable experiments are possible.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114579409","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}

{"title":"Scale Virtual Worlds through Dynamic Load Balancing","authors":"Huaiyu Liu, M. Bowman","doi":"10.1109/DS-RT.2010.14","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.14","url":null,"abstract":"Dynamic load balancing holds the potential to scale virtual worlds flexibly by dynamic allocation of hardware to match load. In this paper, we study the benefits and overheads of space based load partitioning, in particular, distributed binary space partitioning (BSP). Our evaluation is based on Open Simulator, a virtual world system compatible with Second Life® viewers. Our work reveals that although simple and effective, distributed BSP has several limitations and suffers from high overhead. We then analyze the fundamental reasons of these limitations. To overcome the limitations, we argue that it is necessary to break away from the simulator-centric architecture used in today’s virtual worlds, and present potential new directions.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114866455","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}

{"title":"Hierarchical Federation Composition for Information Hiding in HLA-Based Distributed Simulation","authors":"J. Ahn, Moon Gi Seok, C. Sung, T. Kim","doi":"10.1109/DS-RT.2010.35","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.35","url":null,"abstract":"This paper presents a hierarchical federation system interconnected among federations and proposes a hierarchical federation composition algorithm that composes federations into different compositions of hierarchical federations and then efficiently assigns composite federations to a distributed environment while enabling information hiding. We implement the hierarchical federation system and evaluate it using real networks. The experimental results show that our composition algorithm performs better than a random composition algorithm in optimizing the composition of federations while achieving information hiding.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127569033","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}

{"title":"Semantics in Course of Action Modeling and Simulation","authors":"H. Marques, J. M. P. D. Oliveira, P. Costa","doi":"10.1109/DS-RT.2010.32","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.32","url":null,"abstract":"Planning courses of action for a task force component involves analyzing a considerable amount of data, as well as assessing the available options and their respective impact to the operational goals. This is a time consuming process that is dramatically restricted by the currently established doctrine, which allocates a too short period for this task during its decision cycle. An inefficient COA planning generates losses of resources and compromises the ability of a force to achieve the desired effects in each mission. This study investigates the possibilities of using semantics to support courses of action modeling and simulation via a web services architecture. Our preliminary results indicate that with this semantics-based approach it is possible to automatically generate more than one course of action analysis on the basis of the commander´s intent in a timely manner.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570025","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}

{"title":"A Three-Phases Byzantine Fault Tolerance Mechanism for HLA-Based Simulation","authors":"Zengxiang Li, Wentong Cai, S. Turner, K. Pan","doi":"10.1109/DS-RT.2010.24","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.24","url":null,"abstract":"A large scale HLA-based simulation (federation) is composed of a large number of simulation components (federates), which may be developed by different participants and executed at different locations. Byzantine failures, caused by malicious attacks and software/hardware bugs, might happen to federates and propagate in the federation execution. In this paper, a three-phases (i.e., failure detection, failure location, and failure recovery) Byzantine Fault Tolerance (BFT) mechanism is proposed based on the decoupled federate architecture. By combining the replication, check pointing and message logging techniques, some redundant executions of federate replicas are avoided. The BFT mechanism is implemented using both Barrier and No-Barrier federate replication structures. Protocols are also developed to remove the epidemic effect caused by Byzantine failures. As the experiment results show, the BFT mechanism using No-Barrier replication outperforms that using Barrier replication significantly in the case that federate replicas have different runtime performance.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121291225","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}

{"title":"Supporting Multi-dimensional Range Query in HD Tree","authors":"YunFeng Gu, A. Boukerche, Xun Ye, R. B. Araujo","doi":"10.1109/DS-RT.2010.17","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.17","url":null,"abstract":"There are two basic concerns for supporting multi-dimensional range query in P2P overlay networks. The first is to preserve data locality in the process of data space partitioning, and the second is the maintenance of data locality among data items with an exponentially expanding rate and an exponentially extending rate. The first problem has been well addressed by using recursive decomposition schemes, such as Quad tree, K-d tree, Z-order, and Hilbert curve. While the second problem was recently identified by our novel data structure: HD Tree. This paper is a follow-up to our previous work in HD Tree. In this paper, we explore how data locality can be easily maintained, and how range query can be efficiently supported in HD Tree. This is done by introducing two basic routing strategies, hierarchical routing and distributed routing. Although hierarchical routing can be applied to any two nodes in the system, it generates high volume traffic towards nodes near the root, and has very limited options to cope with a node failure. On the other hand, distributed routing concerns source and destination pairs only at the same depth, but traffic load is bound to some nodes at two neighboring depths, and multiple options can be found to redirect a routing request. Because HD Tree supports multiple routes between any two nodes in the system, routing in HD Tree is very flexible, and can be designed for many purposes, like fault tolerance, or dynamic load balancing. Distributed Routing Oriented Combined Routing algorithm is one such routing strategies implemented so far. It is a hybrid algorithm combining advantages from both the hierarchical routing and the distributed routing. The experimental results show that the DROCR algorithm achieves considerable performance gain over the equivalent tree routing at the highest depth examined. In the experiment of supporting multi-dimensional range query, we employ the Z-order space filling curve over the HD Tree overlay layer. We are expecting that the performance of range query will vary proportionally with the change of range size, and reasonably with the increase of dimensionality.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127039574","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}

{"title":"Performance Evaluation of PDES on Multi-core Clusters","authors":"Ketan Bahulkar, Nicole Hofmann, Deepak Jagtap, N. Abu-Ghazaleh, D. Ponomarev","doi":"10.1109/DS-RT.2010.23","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.23","url":null,"abstract":"Trends in VLSI and micro architecture design have ushered in the multi-core era, where the number of cores on a chip is expected to grow with every processor generation. Soon, each chip will have a large number of tightly integrated processing cores with communication latencies substantially lower than those present in conventional clusters. Clusters made of such microprocessors experience non-uniform latencies between cores: cores on the same chip can communicate faster than cores on different chips, cores on the same machine can communicate faster than cores on different machines. In this paper, we characterize the performance of PDES models on a cluster of dual quad-core machines using a parameterizable modified version of Phold, a standard benchmark for parallel simulation. We study various combinations of regional and remote communication patterns to quantify the impact of communication on overall performance of simulation. We discover that the amount of communication has determining impact and it’s essential to optimize this communication at each level to take maximum advantage of multi-core platform. We show that partitioning significantly improves performance. We also explore the impact of load imbalance on application performance and provide critical insight into how to partition for these different environments. We believe that this study represents a significant first step in characterizing the performance space for PDES on this emerging platform.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124585657","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}

{"title":"Distributed and Interactive Simulations Operating at Large Scale for Transcontinental Expeimentation","authors":"T. D. Gottschalk, Ke-Thia Yao, G. Wagenbreth, R. Lucas, D. Davis","doi":"10.1109/DS-RT.2010.29","DOIUrl":"https://doi.org/10.1109/DS-RT.2010.29","url":null,"abstract":"This paper addresses the use of emerging technologies to respond to the increasing needs for larger and more sophisticated agent-based simulations of urban areas. The U.S. Joint Forces Command has found it useful to seek out and apply technologies largely developed for academic research in the physical sciences. The use of these techniques in transcontinentally distributed, interactive experimentation has been shown to be effective and stable and the analyses of the data find parallels in the behavioral sciences. The authors relate their decade and a half experience in implementing high performance computing hardware, software and user inter-face architectures. These have enabled heretofore unachievable results. They focus on three advances: the use of general purpose graphics processing units as computing accelerators, the efficiencies derived from implementing interest managed routers in distributed systems, and the benefits of effective data management for the voluminous information.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128982468","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}