A Mobile Ambients-based Approach for Network Attack Modelling and Simulation

Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through security perimeters and traverse a network to reach valuable assets deep inside the network. Although scalability is no longer the main issue, Attack Graphs still have some problems that make them less useful in practice. First, Attack Graphs remain difficult to relate to the network topology. Second, Attack Graphs traditionally only consider the exploitation of vulnerable hosts. Third, Attack Graphs do not rely on automatic identification of potential attack targets. We address these gaps in our MsAMS (Multi-step Attack Modelling and Simulation) tool, based on Mobile Ambients. The tool not only allows the modelling of more static aspects of the network, such as the network topology, but also the dynamics of network attacks. In addition to Mobile Ambients, we use the PageRank algorithm to determine targets and hub scores produced by the HITS (Hypertext Induced Topic Search) algorithm to guide the simulation of an attacker searching for targets

A Mobile Ambients-based Approach for Network Attack Modelling and Simulation

Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through security perimeters and traverse a network to reach valuable assets deep inside the network. Although scalability is no longer the main issue, Attack Graphs still have some problems that make them less useful in practice. First, Attack Graphs remain difficult to relate to the network topology. Second, Attack Graphs traditionally only consider the exploitation of vulnerable hosts. Third, Attack Graphs do not rely on automatic identification of potential attack targets. We address these gaps in our MsAMS (Multi-step Attack Modelling and Simulation) tool, based on Mobile Ambients. The tool not only allows the modelling of more static aspects of the network, such as the network topology, but also the dynamics of network attacks. In addition to Mobile Ambients, we use the PageRank algorithm to determine targets and hub scores produced by the HITS (Hypertext Induced Topic Search) algorithm to guide the simulation of an attacker searching for targets

An improved multi-agent simulation methodology for modelling and evaluating wireless communication systems resource allocation algorithms

Multi-Agent Systems (MAS) constitute a well known approach in modelling dynamical real world systems. Recently, this technology has been applied to Wireless Communication Systems (WCS), where efficient resource allocation is a primary goal, for modelling the physical entities involved, like Base Stations (BS), service providers and network operators. This paper presents a novel approach in applying MAS methodology to WCS resource allocation by modelling more abstract entities involved in WCS operation, and especially the concurrent network procedures (services). Due to the concurrent nature of a WCS, MAS technology presents a suitable modelling solution. Services such as new call admission, handoff, user movement and call termination are independent to one another and may occur at the same time for many different users in the network. Thus, the required network procedures for supporting the above services act autonomously, interact with the network environment (gather information such as interference conditions), take decisions (e.g. call establishment), etc, and can be modelled as agents. Based on this novel simulation approach, the agent cooperation in terms of negotiation and agreement becomes a critical issue. To this end, two negotiation strategies are presented and evaluated in this research effort and among them the distributed negotiation and communication scheme between network agents is presented to be highly efficient in terms of network performance. The multi-agent concept adapted to the concurrent nature of large scale WCS is, also, discussed in this paper

Simulation study for investment decisions on the EcoBoost camshaft machining line

Design/redesign of manufacturing systems is a complex, risky, and expensive task. Ford Motor Company’s Valencia Engine Plant faces this challenge as it plans to upgrade its machining and assembly lines to introduce the new EcoBoost engines. The research project described in this paper aimed to support the transition process particularly at the camshaft machining line by using simulation modelling techniques. A series of experiments was carried out using the simulation model developed, and recommendations were proposed based on the results of these experiments to support the decision as to where to invest on the line. The outcomes from the research project indicated that investment is required in terms of increasing the capacity of two bottleneck operations through retooling and improving the conveyor routing logic in one key area. Keywords: simulation modelling, closed-loop network, automotive production system

Distributed Individual-Based Environmental Simulation

This paper describes the development and construction of a distributed model allowing the simulation of a large population. Particular attention will be paid to allowing the modelling of an individual's behaviour, communication and interaction with a shared environment. Individual based modelling is not a new concept, nor is the idea of distributed simulations, the system detailed here offers a means of combining these two paradigms into one large-scale modelling environment. A key concept in this system is that each individual being modelled is implemented as a separate process. This atomisation of the model allows the simulation a greater flexibility, individuals can be rapidly developed and the simulation can be spread over a wide number of machines of varying architectures. In an attempt to produce a flexible, extensible, individual based model of a large number of individual subjects the client-server paradigm has been employed. Combining the individual-based modelling techniques with a client-server network architecture has been found to be quite straightforward with the added bonus of having communication between individuals included for free. The idea of considering the problem as one of interaction between an individual and the environment means that the problems normally associated with distributed simulations, those of continuity of world-views for different clients and of communication between clients, are easily solved. Although this system has been developed originally to allow simulations of the Mountain Gorilla (Gorilla Gorilla Beringe) population, the modelling methods employed have meant that almost any entity can be simulated with very little change to the basic simulation processes

Aplication of Flotran CFD in ANSYS

Simulation program ANSYS. The aerodynamic simulation with CFD (Computational Fluid Dynamics). Finite element method (FEM). Volume element method (VEM). The fl uid fl ow problem is defi ned by the laws of conservation of mass, momentum, and energy. Eight turbulence models in FLOTRAN CFD. The geometric parameters of fl uid dynamic simulation are described by fi nite network using many points. In ANSYS system there are two basic elements for FLORTAN - CFD. For tasks solved in plane FLUID 141 is used and for tasks solved in space FLUID 142 is applied. Simplifi ed modelling of net for insect with support of real constant

Molecular Model of Dynamic Social Network Based on E-mail communication

In this work we consider an application of physically inspired sociodynamical model to the modelling of the evolution of email-based social network. Contrary to the standard approach of sociodynamics, which assumes expressing of system dynamics with heuristically defined simple rules, we postulate the inference of these rules from the real data and their application within a dynamic molecular model. We present how to embed the n-dimensional social space in Euclidean one. Then, inspired by the Lennard-Jones potential, we define a data-driven social potential function and apply the resultant force to a real e-mail communication network in a course of a molecular simulation, with network nodes taking on the role of interacting particles. We discuss all steps of the modelling process, from data preparation, through embedding and the molecular simulation itself, to transformation from the embedding space back to a graph structure. The conclusions, drawn from examining the resultant networks in stable, minimum-energy states, emphasize the role of the embedding process projecting the non–metric social graph into the Euclidean space, the significance of the unavoidable loss of information connected with this procedure and the resultant preservation of global rather than local properties of the initial network. We also argue applicability of our method to some classes of problems, while also signalling the areas which require further research in order to expand this applicability domain