Interest Management (IM) aims at eliminating irrelevant state updates transmitted in Networked Virtual Environment (NVE), such as online games. The existing IM mechanisms include area-based, cell-based mechanisms and hybrid IM mechanism which reduces the communication overhead by utilizing the cell-based mechanism to reduce Area-Of-Interest (AOI) updates in the area-based mechanism. Comparing to the existing IM mechanisms, the recently proposed collaborative IM mechanism (CIM) successfully reduces the communication cost further. However, two problems exist in the current CIM mechanism: i) the protocol may fail under certain circumstances, and ii) the protocol requires dividing the virtual environment into fixed grids. In this paper, we focus on the approaches that could enhance the current CIM mechanism and we will evaluate the performance using simulation of multiplayer game scenarios.
{"title":"Enhancement of Collaborative Interest Management Mechanism for P2P Networked Virtual Environment","authors":"Cheng Liu, Wentong Cai","doi":"10.1109/PADS.2012.16","DOIUrl":"https://doi.org/10.1109/PADS.2012.16","url":null,"abstract":"Interest Management (IM) aims at eliminating irrelevant state updates transmitted in Networked Virtual Environment (NVE), such as online games. The existing IM mechanisms include area-based, cell-based mechanisms and hybrid IM mechanism which reduces the communication overhead by utilizing the cell-based mechanism to reduce Area-Of-Interest (AOI) updates in the area-based mechanism. Comparing to the existing IM mechanisms, the recently proposed collaborative IM mechanism (CIM) successfully reduces the communication cost further. However, two problems exist in the current CIM mechanism: i) the protocol may fail under certain circumstances, and ii) the protocol requires dividing the virtual environment into fixed grids. In this paper, we focus on the approaches that could enhance the current CIM mechanism and we will evaluate the performance using simulation of multiplayer game scenarios.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130568206","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}
For a scalable Massively Multiplayer Online Game (MMOG), interest management (IM) is an essential component to reduce unnecessary network traffic. As Area-Of-Interest (AOI) defines each player's interests, an entity normally maintains a subscriber list of players whose AOIs cover the position of the entity. To maintain the subscriber list, players are required to send AOI updates. Unfortunately, AOI update is vulnerable to information exposure (IE) attack especially on P2P infrastructure. Sensitive information, such as player's position, can be revealed during AOI update without owner's authorization and attention. This eventually results in an unfair game. In this paper, we demonstrate that such IE attack on MMOG can help cheaters gain unauthorized benefits. Notably, we present a Monte Carlo based simulator to quantitatively measure the impact of IE attack when different IM schemes are applied. Three P2P schemes are assessed and a Client/Server scheme is also employed for comparison. In addition, we also evaluate IE attack when a group of players collude with each other to share information. Experimental data obtained from simulation are analyzed and explained. Practical suggestions are also given for choosing an IM scheme for P2P gaming.
{"title":"Measuring Information Exposure Attacks on Interest Management","authors":"J. Hao, Wentong Cai","doi":"10.1109/PADS.2012.24","DOIUrl":"https://doi.org/10.1109/PADS.2012.24","url":null,"abstract":"For a scalable Massively Multiplayer Online Game (MMOG), interest management (IM) is an essential component to reduce unnecessary network traffic. As Area-Of-Interest (AOI) defines each player's interests, an entity normally maintains a subscriber list of players whose AOIs cover the position of the entity. To maintain the subscriber list, players are required to send AOI updates. Unfortunately, AOI update is vulnerable to information exposure (IE) attack especially on P2P infrastructure. Sensitive information, such as player's position, can be revealed during AOI update without owner's authorization and attention. This eventually results in an unfair game. In this paper, we demonstrate that such IE attack on MMOG can help cheaters gain unauthorized benefits. Notably, we present a Monte Carlo based simulator to quantitatively measure the impact of IE attack when different IM schemes are applied. Three P2P schemes are assessed and a Client/Server scheme is also employed for comparison. In addition, we also evaluate IE attack when a group of players collude with each other to share information. Experimental data obtained from simulation are analyzed and explained. Practical suggestions are also given for choosing an IM scheme for P2P gaming.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130340868","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}
Credibility is an important part of combat simulation research, which restricts application qualities of simulation in the operational decision-making. Most of credibility evaluation methods measure the credibility by analyzing gap between simulation results and actual results, but the actual results of combat cannot be predicted. The paper brings forward a credibility evaluation method based on event logic analysis, using the same form of event logical graph models to describe the combat process in simulation and theory. According to the merger thoughts, the paper also gives a strategy of contrast between the two event logic models, which can measure the flow rationality of simulation models by analyzing the event coverage degree and process matching degree between simulation logic models and theoretic logical models.
{"title":"Research on a Method of Combat Simulation Creditability Evaluation Based on Event Logic Analysis","authors":"Ming Sun, Hui-xian Tao, Lei Zhang","doi":"10.1109/PADS.2012.36","DOIUrl":"https://doi.org/10.1109/PADS.2012.36","url":null,"abstract":"Credibility is an important part of combat simulation research, which restricts application qualities of simulation in the operational decision-making. Most of credibility evaluation methods measure the credibility by analyzing gap between simulation results and actual results, but the actual results of combat cannot be predicted. The paper brings forward a credibility evaluation method based on event logic analysis, using the same form of event logical graph models to describe the combat process in simulation and theory. According to the merger thoughts, the paper also gives a strategy of contrast between the two event logic models, which can measure the flow rationality of simulation models by analyzing the event coverage degree and process matching degree between simulation logic models and theoretic logical models.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134555586","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}
The cloud computing paradigm attracts increasing amount of Modeling&Simulation (M&S) practitioners to perform their simulations in the cloud. Two issues, namely, the architecture of the Cloud-based Simulation (CSim) and the parallel simulation job scheduling in the CSim, should be addressed ï¬rst to make the CSim practical. This paper reports our recent work on the two issues. The architecture we proposed covers the software involved in the whole process of M&S by providing the Modeling as a Service (MaaS), the Execution as a Service (EaaS) and the Analysis as a Service (AaaS). The architecture also encourages the reuse of available simulation resources with the aid of the Simulation Resource as a Service (SRaaS). For the issue of parallel simulation job scheduling in the CSim, we ï¬rst propose a two-tier processor partition method to organize virtual machines (VMs) for parallel simulation workload consolidation, the two-tier VMs have different CPU priority. We then present four scheduling algorithms under such a partition method to cope with four common situations. Our extensive experiments on well-known traces show that all the four algorithms signiï¬cantly outperform their competitors.
{"title":"Cloud-Based Simulation: The State-of-the-Art Computer Simulation Paradigm","authors":"Xiaocheng Liu, X. Qiu, Bin Chen, Kedi Huang","doi":"10.1109/PADS.2012.11","DOIUrl":"https://doi.org/10.1109/PADS.2012.11","url":null,"abstract":"The cloud computing paradigm attracts increasing amount of Modeling&Simulation (M&S) practitioners to perform their simulations in the cloud. Two issues, namely, the architecture of the Cloud-based Simulation (CSim) and the parallel simulation job scheduling in the CSim, should be addressed ï¬rst to make the CSim practical. This paper reports our recent work on the two issues. The architecture we proposed covers the software involved in the whole process of M&S by providing the Modeling as a Service (MaaS), the Execution as a Service (EaaS) and the Analysis as a Service (AaaS). The architecture also encourages the reuse of available simulation resources with the aid of the Simulation Resource as a Service (SRaaS). For the issue of parallel simulation job scheduling in the CSim, we ï¬rst propose a two-tier processor partition method to organize virtual machines (VMs) for parallel simulation workload consolidation, the two-tier VMs have different CPU priority. We then present four scheduling algorithms under such a partition method to cope with four common situations. Our extensive experiments on well-known traces show that all the four algorithms signiï¬cantly outperform their competitors.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122402180","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}
A new optimistic synchronization algorithm for Parallel Discrete Event Simulation (PDES) called Safe BTW is proposed in this paper. This new algorithm eliminates risky event processing in the Time Warp processing stage of the original BTW algorithm and is founded on a concept called "safe causal relation". In our new algorithm, the length of any chained rollback operations is limited to at most one and cascading rollback effects found in the original BTW algorithm can be completely avoided. Performance tests of Time Warp, Breathing Time Bucket, Breathing Time Warp and the new Safe BTW algorithms using PHOLD model show that the new algorithm obtains better speedups as the computation scales up. Its effective event processing time as a percentage of the total event processing time is higher than that of Time Warp and Breathing Time Warp, proving that excessive rollback operations are successfully controlled. And the extra synchronization overhead it introduces is still much lower than that of Breathing Time Bucket itself and is within tolerable and stable level as the computation scales up.
提出了一种新的并行离散事件模拟(PDES)的乐观同步算法——Safe BTW。该算法基于“安全因果关系”的概念，消除了原BTW算法中时间扭曲处理阶段的风险事件处理。在我们的新算法中，任何链式回滚操作的长度都被限制在最多一次，并且可以完全避免原BTW算法中存在的级联回滚效应。对Time Warp、Breathing Time Bucket、Breathing Time Warp和基于hold模型的新的Safe BTW算法的性能测试表明，随着计算量的扩大，新算法获得了更好的加速。其有效事件处理时间占总事件处理时间的百分比高于时间扭曲和呼吸时间扭曲，证明成功控制了过多的回滚操作。它引入的额外同步开销仍然比Breathing Time Bucket本身要低得多，并且随着计算的扩展，它在可容忍和稳定的水平内。
{"title":"SafeBTW: A Scalable Optimistic Yet Non-risky Synchronization Algorithm","authors":"Yaocheng Zhang, Ge Li","doi":"10.1109/PADS.2012.39","DOIUrl":"https://doi.org/10.1109/PADS.2012.39","url":null,"abstract":"A new optimistic synchronization algorithm for Parallel Discrete Event Simulation (PDES) called Safe BTW is proposed in this paper. This new algorithm eliminates risky event processing in the Time Warp processing stage of the original BTW algorithm and is founded on a concept called \"safe causal relation\". In our new algorithm, the length of any chained rollback operations is limited to at most one and cascading rollback effects found in the original BTW algorithm can be completely avoided. Performance tests of Time Warp, Breathing Time Bucket, Breathing Time Warp and the new Safe BTW algorithms using PHOLD model show that the new algorithm obtains better speedups as the computation scales up. Its effective event processing time as a percentage of the total event processing time is higher than that of Time Warp and Breathing Time Warp, proving that excessive rollback operations are successfully controlled. And the extra synchronization overhead it introduces is still much lower than that of Breathing Time Bucket itself and is within tolerable and stable level as the computation scales up.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127128707","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}
The knowledge-based simulation experiment data integrative analysis tool that utilizes the knowledge model of sample data extraction and the database of analysis project is designed to implement the integrative analysis operation including simulation experiment data import, sample data extraction, data analysis, simulation system characters appraisement and the generation of analysis results report. The tool has been applied in many simulation experiments and the results show that it can improve the efficiency of simulation experiment data analysis and reduce the cost for employing the researchers.
{"title":"Knowledge-Based Simulation Experiment Data Integrative Analysis Technology","authors":"S. Jiao, Wei Li, P. Ma, Ming Yang","doi":"10.1109/PADS.2012.23","DOIUrl":"https://doi.org/10.1109/PADS.2012.23","url":null,"abstract":"The knowledge-based simulation experiment data integrative analysis tool that utilizes the knowledge model of sample data extraction and the database of analysis project is designed to implement the integrative analysis operation including simulation experiment data import, sample data extraction, data analysis, simulation system characters appraisement and the generation of analysis results report. The tool has been applied in many simulation experiments and the results show that it can improve the efficiency of simulation experiment data analysis and reduce the cost for employing the researchers.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117037568","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}
With the fast urbanization of our modern society, transportation systems in cities are facing increasing problems such as congestion, collisions, and high levels of emissions. Researchers have been searching for solutions by investigating better urban planning and transportation policies, introducing new technologies such as Intelligent Transportation System (ITS), or introducing more environmentally friendly vehicles such as electric vehicles (EVs). Traffic modeling and simulation is one tool adopted by researchers for more than half a century [1] to help authorities assess new infrastructure design, and new policies without impacting real traffic. City-scale nanoscopic traffic simulation is a challenging problem that requires parallelization and distribution. In this paper, we have given an overview of the architecture for our nanoscopic traffic simulator SEMSim. For efficient parallel simulation, reducing the dependencies between the various LPs is crucial. We have specified a multi-objective optimization problem concerned with the allocation of agents to clusters. In our future work, we will implement a nanoscopic traffic simulation and devise methods to solve this problem dynamically. Given the difficulty of the problem, these methods will have to make use of domain-specific knowledge, such as information about the topology of the road network.
{"title":"SEMSim: A Distributed Architecture for Multi-scale Traffic Simulation","authors":"Yadong Xu, Heiko Aydt, M. Lees","doi":"10.1109/PADS.2012.40","DOIUrl":"https://doi.org/10.1109/PADS.2012.40","url":null,"abstract":"With the fast urbanization of our modern society, transportation systems in cities are facing increasing problems such as congestion, collisions, and high levels of emissions. Researchers have been searching for solutions by investigating better urban planning and transportation policies, introducing new technologies such as Intelligent Transportation System (ITS), or introducing more environmentally friendly vehicles such as electric vehicles (EVs). Traffic modeling and simulation is one tool adopted by researchers for more than half a century [1] to help authorities assess new infrastructure design, and new policies without impacting real traffic. City-scale nanoscopic traffic simulation is a challenging problem that requires parallelization and distribution. In this paper, we have given an overview of the architecture for our nanoscopic traffic simulator SEMSim. For efficient parallel simulation, reducing the dependencies between the various LPs is crucial. We have specified a multi-objective optimization problem concerned with the allocation of agents to clusters. In our future work, we will implement a nanoscopic traffic simulation and devise methods to solve this problem dynamically. Given the difficulty of the problem, these methods will have to make use of domain-specific knowledge, such as information about the topology of the road network.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128195161","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}
Chen Liu, Jihong Cai, Kai Yang, Duzheng Qing, Mingwen Chen
The distributed simulation is popular in both commercial and academic M&S. One of the main challenges faced by large-scale use is a speedy information transmission(IT) technology, where traditional ones such as unicast, broadcast and mul-ticast may not suitable for large scale applications because of the lack of transmission control. In this paper, we present a content based IT technology via a simplified belonging tree(BT). It uses attributes-value pairs and a set of predicates to formally denote information and consumer's interests. So it can transmit information based on its content rather than its destination address, which provides a fine-granularity transmission control. Based on insights of belonging relation-ships among consumer's interests, a simplified BT is proposed to preserve relationships and optimize IT. Experiments show that by contrast with the compared method, our method significantly reduces the time cost for maintaining BT and can always perform on a high level while the application scale grows.
{"title":"A Simplified Belonging Tree for Optimizing Information Transmission on Large-Scale Distributed Simulations","authors":"Chen Liu, Jihong Cai, Kai Yang, Duzheng Qing, Mingwen Chen","doi":"10.1109/PADS.2012.6","DOIUrl":"https://doi.org/10.1109/PADS.2012.6","url":null,"abstract":"The distributed simulation is popular in both commercial and academic M&S. One of the main challenges faced by large-scale use is a speedy information transmission(IT) technology, where traditional ones such as unicast, broadcast and mul-ticast may not suitable for large scale applications because of the lack of transmission control. In this paper, we present a content based IT technology via a simplified belonging tree(BT). It uses attributes-value pairs and a set of predicates to formally denote information and consumer's interests. So it can transmit information based on its content rather than its destination address, which provides a fine-granularity transmission control. Based on insights of belonging relation-ships among consumer's interests, a simplified BT is proposed to preserve relationships and optimize IT. Experiments show that by contrast with the compared method, our method significantly reduces the time cost for maintaining BT and can always perform on a high level while the application scale grows.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128198830","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}
Artificial Society had been seemed as a new way to study emergence management. The traditional modeling and simulation could not satisfy the large population in Artificial Society. A Two-tier Parallel Architecture simulation is proposed to solve the large scale problem. Based on the analysis of parallelism degrees in Artificial Society, both MPI and GPU computation are used to construct the novel architecture. The experiments testify the high performance.
{"title":"A Two-Tier Parallel Architecture for Artificial Society Simulation","authors":"Bin Chen, Gang Guo","doi":"10.1109/PADS.2012.8","DOIUrl":"https://doi.org/10.1109/PADS.2012.8","url":null,"abstract":"Artificial Society had been seemed as a new way to study emergence management. The traditional modeling and simulation could not satisfy the large population in Artificial Society. A Two-tier Parallel Architecture simulation is proposed to solve the large scale problem. Based on the analysis of parallelism degrees in Artificial Society, both MPI and GPU computation are used to construct the novel architecture. The experiments testify the high performance.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127267510","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}
Due to catastrophic disasters induced by forces of nature like flooding or tsunamis, terrorism or nuclear power plant accidents, understanding the dynamics of urban evacuation systems has elicited massive interest over the past years. While discrete event simulations of evacuation models become prohibitively complex dealing with the time, space and individual behavior, multiagent based models have revealed to be a potentially more effective. This paper introduces models of configurations of social agents at a massive scale, which, together with the most recent supercomputing technology, allows for a simulation analysis of realistic evacuation models at the level of large cities (106 -108 agents). Agent based models of demographics and the morphology of cities together with population densities, mobility patterns, individual decision making, and agent interactions are implemented into a tool chain which ultimately generates Repast HPC code, which is then executed on a 2,048 node shared memory multiprocessor server (SGI Altix UV-1000). We demonstrate how different evacuation strategies can be assessed based on costly, yet feasible simulation runs - thus evidencing, that a whole class of demanding, very complex simulation problems has found a convincing solution.
{"title":"A New Opportunity to Urban Evacuation Analysis: Very Large Scale Simulations of Social Agent Systems in Repast HPC","authors":"K. Zia, A. Riener, K. Farrahi, A. Ferscha","doi":"10.1109/PADS.2012.4","DOIUrl":"https://doi.org/10.1109/PADS.2012.4","url":null,"abstract":"Due to catastrophic disasters induced by forces of nature like flooding or tsunamis, terrorism or nuclear power plant accidents, understanding the dynamics of urban evacuation systems has elicited massive interest over the past years. While discrete event simulations of evacuation models become prohibitively complex dealing with the time, space and individual behavior, multiagent based models have revealed to be a potentially more effective. This paper introduces models of configurations of social agents at a massive scale, which, together with the most recent supercomputing technology, allows for a simulation analysis of realistic evacuation models at the level of large cities (106 -108 agents). Agent based models of demographics and the morphology of cities together with population densities, mobility patterns, individual decision making, and agent interactions are implemented into a tool chain which ultimately generates Repast HPC code, which is then executed on a 2,048 node shared memory multiprocessor server (SGI Altix UV-1000). We demonstrate how different evacuation strategies can be assessed based on costly, yet feasible simulation runs - thus evidencing, that a whole class of demanding, very complex simulation problems has found a convincing solution.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134254703","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：