An Agent-Based Intrusion Detection System for Local Area Networks

Since it is impossible to predict and identify all the vulnerabilities of a network beforehand, and penetration into a system by malicious intruders cannot always be prevented, intrusion detection systems (IDSs) are essential entities to ensure the security of a networked system. To be effective in carrying out their functions, the IDSs need to be accurate, adaptive, and extensible. Given these stringent requirements and the high level of vulnerabilities of the current days' networks, the design of an IDS has become a very challenging task. Although, an extensive research has been done on intrusion detection in a distributed environment, distributed IDSs suffer from a number of drawbacks e.g., high rates of false positives, low detection efficiency etc. In this paper, the design of a distributed IDS is proposed that consists of a group of autonomous and cooperating agents. In addition to its ability to detect attacks, the system is capable of identifying and isolating compromised nodes in the network thereby introducing fault-tolerance in its operations. The experiments conducted on the system have shown that it has a high detection efficiency and low false positives compared to some of the currently existing systems.Comment: 13 pages, 5 figures, 2 table

Probabilistic modeling and reasoning in multiagent decision systems

Ph.DDOCTOR OF PHILOSOPH

Time constraint agents? coordination and learning in cooperative multi-agent system

Ph.DDOCTOR OF PHILOSOPH

Testing and improving local adaptive importance sampling in LJF local-JT in multiply sectioned Bayesian networks

Multiply Sectioned Bayesian Network (MSBN) provides a model for probabilistic reasoning in multi-agent systems. The exact inference is costly and difficult to be applied in the context of MSBNs. So the approximate inference is used as an alternative. Recently, for reasoning in MSBNs, LJF-based Local Adaptive Importance Sampler (LLAIS) has been developed for approximate reasoning in MSBNs. However, the prototype of LLAIS is tested on Alarm Network (37 nodes). But further testing on larger networks has not been reported. In this thesis, LLAIS algorithm is tested on three large networks namely Hailfinder (56 nodes), Win95pts (76 nodes) and PathFinder (109 nodes), to measure for its reliability and scalability. The experiments done show that LLAIS without parameters tuned shows good convergence for Hailfinder and Win95pts but not for Pathfinder network. However, when the parameters are tuned the algorithm shows considerable improvement in its accuracy for all the three networks tested

Inference in distributed multiagent reasoning systems in cooperation with artificial neural networks

This research is motivated by the need to support inference in intelligent decision support systems offered by multi-agent, distributed intelligent systems involving uncertainty. Probabilistic reasoning with graphical models, known as Bayesian networks (BN) or belief networks, has become an active field of research and practice in artificial intelligence, operations research, and statistics in the last two decades. At present, a BN is used primarily as a stand-alone system. In case of a large problem scope, the large network slows down inference process and is difficult to review or revise. When the problem itself is distributed, domain knowledge and evidence has to be centralized and unified before a single BN can be created for the problem. Alternatively, separate BNs describing related subdomains or different aspects of the same domain may be created, but it is difficult to combine them for problem solving, even if the interdependency relations are available. This issue has been investigated in several works, including most notably Multiply Sectioned BNs (MSBNs) by Xiang [Xiang93]. MSBNs provide a highly modular and efficient framework for uncertain reasoning in multi-agent distributed systems. Inspired by the success of BNs under the centralized and single-agent paradigm, a MSBN representation formalism under the distributed and multi-agent paradigm has been developed. This framework allows the distributed representation of uncertain knowledge on a large and complex environment to be embedded in multiple cooperative agents and effective, exact, and distributed probabilistic inference. What a Bayesian network is, how inference can be done in a Bayesian network under the single-agent paradigm, how multiple agents’ diverse knowledge on a complex environment can be structured as a set of coherent probabilistic graphical models, how these models can be transformed into graphical structures that support message passing, and how message passing can be performed to accomplish tasks in model compilation and distributed inference are covered in details in this thesis

Efficient Probabilistic Inference Algorithms for Cooperative Multiagent Systems

Probabilistic reasoning methods, Bayesian networks (BNs) in particular, have emerged as an effective and central tool for reasoning under uncertainty. In a multi-agent environment, agents equipped with local knowledge often need to collaborate and reason about a larger uncertainty domain. Multiply sectioned Bayesian networks (MSBNs) provide a solution for the probabilistic reasoning of cooperative agents in such a setting. In this thesis, we first aim to improve the efficiency of current MSBN exact inference algorithms. We show that by exploiting the calculation schema and the semantic meaning of inter-agent messages, we can significantly reduce an agent\u27s local computational cost as well as the inter-agent communication overhead. Our novel technical contributions include 1) a new message passing architecture based on an MSBN linked junction tree forest (LJF); 2) a suite of algorithms extended from our work in BNs to provide the semantic analysis of inter-agent messages; 3) a fast marginal calibration algorithm, designed for an LJF that guarantees exact results with a minimum local and global cost. We then investigate how to incorporate approximation techniques in the MSBN framework. We present a novel local adaptive importance sampler (LLAIS) designed to apply localized stochastic sampling while maintaining the LJF structure. The LLAIS sampler provides accurate estimations for local posterior beliefs and promotes efficient calculation of inter-agent messages. We also address the problem of online monitoring for cooperative agents. As the MSBN model is restricted to static domains, we introduce an MA-DBN model based on a combination of the MSBN and dynamic Bayesian network (DBN) models. We show that effective multi-agent online monitoring with bounded error is possible in an MA-DBN through a new secondary inference structure and a factorized representation of forward messages

Using causal knowledge to improve retrieval and adaptation in case-based reasoning systems for a dynamic industrial process

Case-based reasoning (CBR) is a reasoning paradigm that starts the reasoning process by examining past similar experiences. The motivation behind this thesis lies in the observation that causal knowledge can guide case-based reasoning in dealing with large and complex systems as it guides humans. In this thesis, case-bases used for reasoning about processes where each case consists of a temporal sequence are considered. In general, these temporal sequences include persistent and transitory (non-persistent) attributes. As these sequences tend to be long, it is unlikely to find a single case in the case-base that closely matches the problem case. By utilizing causal knowledge in the form of a dynamic Bayesian network (DBN) and exploiting the independence implied by the structure of the network and known attributes, this system matches independent portions of the problem case to corresponding sub-cases from the case-base. However, the matching of sub-cases has to take into account the persistence properties of attributes. The approach is then applied to a real life temporal process situation involving an automotive curing oven, in which a vehicle moves through stages within the oven to satisfy some thermodynamic relationships and requirements that change from stage to stage. In addition, testing has been conducted using data randomly generated from known causal networks. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .T54. Source: Masters Abstracts International, Volume: 45-01, page: 0366. Thesis (M.Sc.)--University of Windsor (Canada), 2006

Graphical modeling of asymmetric games and value of information in multi-agent decision systems

Master'sMASTER OF ENGINEERIN