{"title":"Simulating realistic packet routing without routing protocols","authors":"G. Riley, D. Reddy","doi":"10.1109/PADS.2005.28","DOIUrl":"https://doi.org/10.1109/PADS.2005.28","url":null,"abstract":"A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decisions at each hop along the path should accurately represent decisions made by actual routers with a similar topology. Further, the routing decisions must be affected by topology changes, such as link weight adjustments or node failures. The methods used by the simulation tools to achieve these requirements can be classified into three fundamental classes. First, the simulator can implement a model of any of the well known routing protocols, such as BGP, OSPF, or EIGRP. Assuming the implemented models of these protocols are a reasonable representation of the deployed protocol, the routing decisions and routing updates in the presence of failures are highly accurate and accurately model the real-world network. A second method is to use global topology knowledge within the simulator to pre-compute routing information using any of several graph theoretic algorithms that compute paths through a graph. Should any topology changes occur, the simulator can simply recompute routes based on revised global knowledge. A third method is the use of on-demand routing computations using global topology knowledge, coupled with a source-based routing scheme, such as the well-known NIx-Vector method. Both of the first two methods suffer from excessive memory requirements for routing table storage, which can be O(N/sup 2/) in the extreme case. The last two methods suffer from unrealistic routing decisions in the presence of topology changes, due to the use of instantaneous global topology knowledge. A link failure in some part of the topology is immediately known to all nodes, which results in instantaneous and unrealistic routing updates throughout the network. We present an approach to improve the realism of the on-demand methods, without incurring the O(N/sup 2/) memory overhead of the routing protocol method.","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":"125879958","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":"Dynamically adaptive partition-based data distribution management","authors":"Bora I. Kumova","doi":"10.1109/PADS.2005.8","DOIUrl":"https://doi.org/10.1109/PADS.2005.8","url":null,"abstract":"Performance and scalability of distributed simulations depends primarily on the effectiveness of the employed data distribution management (DDM) algorithm, which aims at reducing the overall computational and messaging effort on the shared data to a necessary minimum. Existing DDM approaches, which are variations and combinations of two basic techniques, namely region-based and grid-based techniques, perform purely in the presence of load differences. We introduce the partition-based technique that allows for variable-size partitioning shared data. Based on this technique, a novel DDM algorithm is introduced that is dynamically adaptive to cluster formations in the shared data as well as in the physical location of the simulation objects. Since the re-distribution is sensitive to inter-relationships between shared data and simulation objects, a balanced constellation has the additional advantage to be of minimal messaging effort. Furthermore, dynamic system scalability is facilitated, as bottlenecks are avoided.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"20 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":"130720405","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":"Merging parallel simulation programs","authors":"Abhishek Agarwal, M. Hybinette","doi":"10.1109/PADS.2005.10","DOIUrl":"https://doi.org/10.1109/PADS.2005.10","url":null,"abstract":"In earlier work cloning is proposed as a means for efficiently splitting a running simulation midway through its execution into multiple parallel simulations. In simulation cloning, clones usually are able to share computations that occur early in the simulation, but as their states diverge individual LPs are replicated as necessary so that their computations proceed independently. However, if, over time the state of the clones (or their constituent LPs) converges there is, as of yet, no means for recombining them. In this case some efficiency is lost because they will execute identical events. This idea is the reverse of cloning, as we merge logical processes that have been previously cloned and we show that this can further increase efficiency because the new un-cloned LPs will complete computations that would otherwise be duplicated. We discuss our implementation of merging, and illustrate its effectiveness in several example simulation scenarios.","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":"130143347","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}
David W. Bauer, G. Yaun, C. Carothers, M. Yuksel, S. Kalyanaraman
{"title":"Seven-O'Clock: a new distributed GVT algorithm using network atomic operations","authors":"David W. Bauer, G. Yaun, C. Carothers, M. Yuksel, S. Kalyanaraman","doi":"10.1109/PADS.2005.27","DOIUrl":"https://doi.org/10.1109/PADS.2005.27","url":null,"abstract":"In this paper we introduce a new concept, network atomic operations (NAOs) to create a zero-cost consistent cut. Using NAOs, we define a wall-clock-time driven GVT algorithm called Seven O'Clock that is an extension of Fujimoto's shared memory GVT algorithm. Using this new GVT algorithm, we report good optimistic parallel performance on a cluster of state-of-the-art Itanium-II quad processor systems for both benchmark applications such as PHOLD and real-world applications such as a large-scale TCP/Internet model. In some cases, super-linear speedup is observed.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"4 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":"131742353","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}
C. Lobb, Zenas C. Chao, R. Fujimoto, Steve M. Potter
{"title":"Parallel event-driven neural network simulations using the Hodgkin-Huxley neuron model","authors":"C. Lobb, Zenas C. Chao, R. Fujimoto, Steve M. Potter","doi":"10.1109/PADS.2005.18","DOIUrl":"https://doi.org/10.1109/PADS.2005.18","url":null,"abstract":"Neural systems are composed of a large number of highly-connected neurons and are widely simulated within the neurological community. In this paper, we examine the application of parallel discrete event simulation techniques to networks of a complex model called the Hodgkin-Huxley neuron. We describe the conversion of this model into an event-driven simulation, a technique that offers the potential of much greater performance in parallel and distributed simulations compared to time-stepped techniques. We report results of an initial set of experiments conducted to determine the feasibility of this parallel event-driven Hodgkin-Huxley model and analyze its viability for large-scale neural simulations.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"15 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":"132545652","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":"Comparative study between analytical models and packet-level worm simulations","authors":"Monirul I. Sharif, G. Riley, Wenke Lee","doi":"10.1109/PADS.2005.5","DOIUrl":"https://doi.org/10.1109/PADS.2005.5","url":null,"abstract":"The threat of Internet worms has been, and continues to be, one of the most important issues faced by networking researchers and network users. The need for accurate and efficient modeling and analysis methods cannot be understated. Models that accurately reflect the behavior of existing and yet-to-be deployed worms is critical to understanding how to deal with this ongoing threat. Recently developed analytical models, have been used to generate propagation trends that match with historic worm outbreaks. However in this effort, the values used for some of the parameters are different from empirically measured information, such as probe rate per unit IP address space. Although not found in simpler models, new analytical models are under development that can take into account various network and worm characteristics. But in order to build and test them accurately real world data has been used. In our work, we have focused on packet-level detail in the simulation models, which can take into account realistic network characteristics that include, queuing delay, packet-loss, link delays and also realistic worm characteristics at the expense of additional computational complexity. Using our simulator we show how it can be a useful tool in analyzing and evaluating analytical worm models. We study the worm propagation pattern predicted by one particular analytical model and compare it to our packet-level simulations.","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":"114703353","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":"/spl mu/sik - a micro-kernel for parallel/distributed simulation systems","authors":"K. Perumalla","doi":"10.1109/PADS.2005.1","DOIUrl":"https://doi.org/10.1109/PADS.2005.1","url":null,"abstract":"A novel micro-kernel approach to building parallel/distributed simulation systems is presented. Using this approach, a unified system architecture is developed for incorporating multiple types of simulation processes. The processes hold potential to employ a variety of synchronization mechanisms, and could even alter their choice of mechanism dynamically. Supported mechanisms include traditional lookahead-based conservative and state saving-based optimistic execution approaches. Also supported are newer mechanisms such as reverse computation-based optimistic execution and aggregation-based event processing, all within a single parsimonious application programming interface. The internal implementation and a preliminary performance evaluation of this interface are presented in /spl mu/sik, which is an efficient parallel/distributed realization of the microkernel architecture in C/sup ++/.","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":"130357644","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}
Everett Anderson, Kevin Eustice, Shane Markstrum, Mark Hansen, Peter Reiher
{"title":"Mobile contagion: simulation of infection & defense","authors":"Everett Anderson, Kevin Eustice, Shane Markstrum, Mark Hansen, Peter Reiher","doi":"10.1109/PADS.2005.14","DOIUrl":"https://doi.org/10.1109/PADS.2005.14","url":null,"abstract":"For worms with known signatures, properly configured firewalls can prevent infection of a network from the outside. However, as several recent worms have shown, portable computers provide worms with an entry point into such networks, since these computers are connected behind the firewall. Once inside, the firewall provides no protection against the worm's further spread. Wireless networks are particularly dangerous in this regard, as the act of connection is often invisible, and improperly configured wireless networks allows anyone within radio range to connect. In this paper, we use real data on a large-scale wireless deployment to analyze the speed with which a worm could spread if it used only this propagation vector. We discuss several possible solutions and provide analysis on how much protection those solutions would provide.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"33 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":"129567807","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}
M. Liljenstam, Jason Liu, D. Nicol, Yougu Yuan, Guanhua Yan, Chris Grier
{"title":"RINSE: the real-time immersive network simulation environment for network security exercises","authors":"M. Liljenstam, Jason Liu, D. Nicol, Yougu Yuan, Guanhua Yan, Chris Grier","doi":"10.1109/PADS.2005.23","DOIUrl":"https://doi.org/10.1109/PADS.2005.23","url":null,"abstract":"The RINSE simulator is being developed to support large-scale network security preparedness and training exercises, involving hundreds of players and a modeled network composed of hundreds of LANs. The simulator must be able to present a realistic rendering of network behavior as attacks are launched and players diagnose events and try counter measures to keep network services operating. We describe the architecture and function of RINSE and outline how techniques like multiresolution traffic modeling and new routing simulation methods are used to address the scalability challenges of this application. We also describe in more detail new work on CPU/memory models necessary for the exercise scenarios and a latency absorption technique that help when extending the range of client tools usable by the players.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"98 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818202","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":"Software diversity as a defense against viral propagation: models and simulations","authors":"Adam J. O'Donnell, H. Sethu","doi":"10.1109/PADS.2005.31","DOIUrl":"https://doi.org/10.1109/PADS.2005.31","url":null,"abstract":"The use of software diversity has often been discussed in the research literature as an effective means to break up the software monoculture present on the Internet and to thus prevent malcode propagation. However, there have been no quantitative studies that examine the effectiveness of software diversity on viral propagation. In this paper, we study both real (an IPv6 BGP topology) and synthetically generated (an Erdos-Renyi random graph) network topologies and employ a popular metric called the epidemic threshold to measure resistance to viral propagation in the presence of software diversity. We show that one can increase the epidemic threshold of a network even with a naive, random distribution of diverse software on the nodes of a network. We also show that an algorithm-driven diversity assignment further increases the epidemic threshold. These results confirm the value of strategic topology-sensitive assignment of diversity to improving the tolerance of a network to malcode propagation.","PeriodicalId":193147,"journal":{"name":"Workshop on Principles of Advanced and Distributed Simulation (PADS'05)","volume":"745 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":"116694014","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}