Workshop on Principles of Advanced and Distributed Simulation (PADS'05)最新文献_第3页

The WarpIV simulation kernel WarpIV仿真内核

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.32

J. Steinman

引用次数: 35

XTW, a parallel and distributed logic simulator XTW，一个并行和分布式逻辑模拟器

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.40

Qing Xu, C. Tropper

引用次数: 31

Performance prediction using simulation of large-scale interconnection networks in POSE 基于大规模互连网络仿真的性能预测

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.20

Terry Wilmarth, G. Zheng, Eric J. Bohm, Yogesh Mehta, Nilesh Choudhury, P. Jagadishprasad, L. Kalé

{"title":"Performance prediction using simulation of large-scale interconnection networks in POSE","authors":"Terry Wilmarth, G. Zheng, Eric J. Bohm, Yogesh Mehta, Nilesh Choudhury, P. Jagadishprasad, L. Kalé","doi":"10.1109/PADS.2005.20","DOIUrl":"https://doi.org/10.1109/PADS.2005.20","url":null,"abstract":"Parallel discrete event simulation (PDES) of models with fine-grained computation remains a challenging problem. We explore the usage of POSE, our parallel object-oriented simulation environment, for application performance prediction on large parallel machines such as BlueGene. This study involves the simulation of communication at the packet level through a detailed network model. This presents an extremely fine-grained simulation: events correspond to the transmission and receipt of packets. Computation is minimal, communication dominates, and strong dependencies between events result in a low degree of parallelism. There is limited look-ahead capability since the outcome of many events is determined by the application whose performance the simulation is predicting. Thus conservative synchronization approaches are challenging for this type of problem. We present recent experiences and performance results for our network simulator and illustrate the utility of our simulator through prediction and validation studies for a molecular dynamics application.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134106376","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}

引用次数: 35

Simulation of network traffic at coarse time-scales 粗时间尺度下的网络流量模拟

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.30

D. Nicol, Guanhua Yan

{"title":"Simulation of network traffic at coarse time-scales","authors":"D. Nicol, Guanhua Yan","doi":"10.1109/PADS.2005.30","DOIUrl":"https://doi.org/10.1109/PADS.2005.30","url":null,"abstract":"Simulation of large-scale networks demands that we model some flows at coarser time-scales than others, simply to keep the execution cost manageable. This paper studies a method for periodically computing traffic at a time-scale larger than that typically used for detailed packet simulations. Applications of this technique include computation of background flows (against which detailed foreground flows are simulated), and simulation of worm propagation in the Internet. Our approach considers aggregated traffic between Internet points of presence, and computes the throughput of each POP-to-POP flow through each router on its path. This problem formulation leads to a non-linear system of equations. We develop means of reducing this system to a smaller set of equations, which are solved using fixed point iteration. We study the convergence behavior, as a function of traffic load, on topologies based on Internet backbone networks. We find that the problem reduction method is very effective, and that convergence is achieved rapidly. We also examine the comparative speedup of the method relative to using pure packet simulation for background flows, and observe speedups of exceeding 5000 using an ordinary PC. We also simulate foreground flows interacting with background flows, and compare the foreground behavior using our solution with that of pure packet flows. We find that these flows behave accurately enough in our approach to justify use of the technique in our motivating application.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121764410","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}

引用次数: 23

Routing worm: a fast, selective attack worm based on IP address information 路由蠕虫:一种基于IP地址信息的快速、选择性攻击蠕虫

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.24

C. Zou, D. Towsley, W. Gong, Songlin Cai

{"title":"Routing worm: a fast, selective attack worm based on IP address information","authors":"C. Zou, D. Towsley, W. Gong, Songlin Cai","doi":"10.1109/PADS.2005.24","DOIUrl":"https://doi.org/10.1109/PADS.2005.24","url":null,"abstract":"Most well-known worms, such as Code Red, Slammer, Blaster, and Sasser, infected vulnerable computers by scanning the entire IPv4 address space. In this paper, we present an advanced worm called \"routing worm\", which implements two advanced attacking techniques. First, a routing worm uses BGP routing tables to only scan the Internet mutable address space, which allows it propagate three times faster than a traditional worm. Second, and more importantly, the geographic information of BGP routing prefixes enables a routing worm to conduct pinpoint \"selective attacks\" by imposing heavy damage to vulnerable computers in a specific country, company, Internet service provider, or autonomous system, without collateral damage done to others. Because of the inherent publicity of BGP routing tables, attackers can easily deploy routing worms, which distinguishes the routing worm from other \"worst-case\" worms. Compared to a traditional worm, a routing worm could possibly cause more severe congestion to the Internet backbone since all scans sent out by a routing worm are Internet mutable (and can only be dropped at the destinations). In addition, it is harder to quickly detect a routing-worm infected computer since we cannot distinguish illegal scans from regular connections without waiting for traffic responses. In order to defend against routing worms and all scanning worms, an effective way is to upgrade the current Internet from IPv4 to IPv6, although such an upgrade will require a tremendous effort and is still a controversial issue.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115686478","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}

引用次数: 123

Optimistic protocol analysis in a performance analyser and prediction tool 性能分析器和预测工具中的乐观协议分析

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.17

P. Teo, S. Turner, Z. Juhász

引用次数: 7

Efficient simulation of wireless networks using lazy MAC state update 使用延迟MAC状态更新的无线网络的高效仿真

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.9

Young J. Lee, G. Riley

{"title":"Efficient simulation of wireless networks using lazy MAC state update","authors":"Young J. Lee, G. Riley","doi":"10.1109/PADS.2005.9","DOIUrl":"https://doi.org/10.1109/PADS.2005.9","url":null,"abstract":"Scalable and efficient network simulation methods are the method of choice for evaluating and verifying wireless network protocols on a moderate to large scale. This need becomes obvious when simulating very large-scale wireless networks such as emerging ad hoc sensor networks in which the number of nodes can be the order of thousands or more, and with very high node density. Unfortunately, simulation of such large-scale wireless networks often requires excessively large amounts of computing resources and can be slow to complete. One approach to achieving higher performance in a large-scale network simulation is the use of parallel or distributed simulation techniques. However, the efficient distributed simulation of wireless ad hoc networks is still a daunting task. Therefore, we turn our attention to more traditional sequential simulation methods, and seek to reduce the overhead incurred in the medium access control (MAC) state update propagation between wireless nodes. We introduce a novel method called LAMP (lazy MAC state update), that substantially reduces this overhead, with no loss of accuracy. Using our wireless network simulation tool, we compare the efficiency of the LAMP approach to the more traditional approach, and show a performance improvement of up to a factor of eight, with no loss of accuracy.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133904900","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}

引用次数: 8

Towards time-parallel road traffic simulation 面向时间平行道路交通仿真

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.33

T. Kiesling, Johannes Lüthi

{"title":"Towards time-parallel road traffic simulation","authors":"T. Kiesling, Johannes Lüthi","doi":"10.1109/PADS.2005.33","DOIUrl":"https://doi.org/10.1109/PADS.2005.33","url":null,"abstract":"As an alternative to spatial parallelization of simulation models, time-parallel simulation offers the potential for massive parallelism with a high level of independence between the parallel processes. Unfortunately, due to inherent problems, the applicability of time-parallel simulation is restricted. Therefore, it has been proposed recently, to use approximation with time-parallel simulation in order to facilitate its application and to extend the class of models suitable for time-parallel simulation. As a proof-of-concept, this work shows how approximate temporal parallelization can be applied to the simulation of road traffic. Traffic simulation is used extensively in transportation research for various purposes, e.g. analysis of traffic phenomena, traffic forecast, and optimization of traffic flow. Depending on the level of fidelity, a traffic model exhibits a state space of moderate to high complexity. This paper is intended to discuss the basic properties of time-parallel traffic simulation and to examine its feasibility. Experiments with a sequential microscopic traffic simulator, that emulates important aspects of a corresponding time-parallel simulator, suggest this feasibility.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122594510","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}

引用次数: 24

Concurrent replication of parallel and distributed simulations 并行和分布式模拟的并发复制

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 2005-06-01 DOI: 10.1109/PADS.2005.6

L. Bononi, Michele Bracuto, Gabriele D’angelo, L. Donatiello

{"title":"Concurrent replication of parallel and distributed simulations","authors":"L. Bononi, Michele Bracuto, Gabriele D’angelo, L. Donatiello","doi":"10.1109/PADS.2005.6","DOIUrl":"https://doi.org/10.1109/PADS.2005.6","url":null,"abstract":"Parallel and distributed simulations enable the analysis of complex systems by concurrently exploiting the aggregate computation power and memory of clusters of execution units. In this paper we investigate a new direction for increasing both the speedup of a simulation process and the utilization of computation and communication resources. Many simulation-based investigations require to collect independent observations for a correct and significant statistical analysis of results. The execution of many independent parallel or distributed simulation runs may suffer the speedup reduction due to rollbacks under the optimistic approach, and due to idle CPU times originated by synchronization and communication bottlenecks under the conservative approach. We present a parallel and distributed simulation framework supporting concurrent replication of parallel and distributed simulations (CR-PADS), as an alternative to the execution of a linear sequence of multiple parallel or distributed simulation runs. Results obtained from tests executed under variable scenarios show that speedup and resource utilization gains could be obtained by adopting the proposed replication approach in addition to the pure parallel and distributed simulation.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126991469","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}

引用次数: 34

Workshop Committees 车间委员会

Workshop on Principles of Advanced and Distributed Simulation (PADS'05) Pub Date : 1900-01-01 DOI: 10.1109/QSIC.2005.71

David M. Nicol, C. Carothers, S. J. Turner, Simon J. E. Taylor, A. S. Elmaghraby, Peter S. Magnusson, Brian W. Unger, George Riley, Richard M Fujimoto, A. Boukerche, Doug Degroot, Lorenzo Donatiello, Axel Lehmann, M. Liljenstam, Jason Liu, Jhonnes Luethi, Ernest H. Page, K. Perumalla, Francesco Quaglia, Rob Simmonds, E. G. Sirer, B. Szymanski, Greg Tackett, Mineo Takai, C. Tropper, A. Uhrmacher, Fred Wieland

引用次数: 0