The Experts below are selected from a list of 12 Experts worldwide ranked by ideXlab platform
Paul Muller - One of the best experts on this subject based on the ideXlab platform.
-
a requirement aware method to reduce complexity in selecting and composing functional block based Protocol Graphs
Networked Digital Technologies, 2012Co-Authors: Daniel Gunther, Nathan Kerr, Paul MullerAbstract:Future Internet research activities try to increase the flexibility of the Internet. A well known approach is to build Protocol Graphs by connecting functional blocks together. The Protocol Graph that should be used is the one most suitable to the application’s requirements. To find the most suitable Graph, all possible Protocol Graphs must be evaluated. However, the number of possible Protocol Graphs increases exponentially as the number of functional blocks increases. This paper presents a method of representing the Protocol Graph search space as a set of search trees and then uses forward pruning to reduce the number of Protocol Graphs evaluated. We evaluate our proposed method by simulation.
-
a simulation model for evaluating the impact of communication services in a functional block based network Protocol Graph
Annual Simulation Symposium, 2012Co-Authors: Daniel Gunther, Nathan Kerr, Paul MullerAbstract:A flexible Future Internet Architecture based on functional blocks will allow the use of different mechanisms to fulfill emerging communication requirements. With this freedom of choice, we can make use of application requirements and system constraints to choose the best Protocol Graph. Each available block impacts the quality of the Protocol Graph. How then can the given requirements and constraints be used to determine which block to use? In this paper we present a simulation model to evaluate the impact of network communication services to decide if a block or a set of blocks composed into a Protocol Graph is able to fulfill the given application requirements and system constraints. The results gained by simulating our presented model show that it is possible to select an appropriate mechanism by matching the application requirements with given offers.
Daniel Gunther - One of the best experts on this subject based on the ideXlab platform.
-
a requirement aware method to reduce complexity in selecting and composing functional block based Protocol Graphs
Networked Digital Technologies, 2012Co-Authors: Daniel Gunther, Nathan Kerr, Paul MullerAbstract:Future Internet research activities try to increase the flexibility of the Internet. A well known approach is to build Protocol Graphs by connecting functional blocks together. The Protocol Graph that should be used is the one most suitable to the application’s requirements. To find the most suitable Graph, all possible Protocol Graphs must be evaluated. However, the number of possible Protocol Graphs increases exponentially as the number of functional blocks increases. This paper presents a method of representing the Protocol Graph search space as a set of search trees and then uses forward pruning to reduce the number of Protocol Graphs evaluated. We evaluate our proposed method by simulation.
-
a simulation model for evaluating the impact of communication services in a functional block based network Protocol Graph
Annual Simulation Symposium, 2012Co-Authors: Daniel Gunther, Nathan Kerr, Paul MullerAbstract:A flexible Future Internet Architecture based on functional blocks will allow the use of different mechanisms to fulfill emerging communication requirements. With this freedom of choice, we can make use of application requirements and system constraints to choose the best Protocol Graph. Each available block impacts the quality of the Protocol Graph. How then can the given requirements and constraints be used to determine which block to use? In this paper we present a simulation model to evaluate the impact of network communication services to decide if a block or a set of blocks composed into a Protocol Graph is able to fulfill the given application requirements and system constraints. The results gained by simulating our presented model show that it is possible to select an appropriate mechanism by matching the application requirements with given offers.
Nathan Kerr - One of the best experts on this subject based on the ideXlab platform.
-
a requirement aware method to reduce complexity in selecting and composing functional block based Protocol Graphs
Networked Digital Technologies, 2012Co-Authors: Daniel Gunther, Nathan Kerr, Paul MullerAbstract:Future Internet research activities try to increase the flexibility of the Internet. A well known approach is to build Protocol Graphs by connecting functional blocks together. The Protocol Graph that should be used is the one most suitable to the application’s requirements. To find the most suitable Graph, all possible Protocol Graphs must be evaluated. However, the number of possible Protocol Graphs increases exponentially as the number of functional blocks increases. This paper presents a method of representing the Protocol Graph search space as a set of search trees and then uses forward pruning to reduce the number of Protocol Graphs evaluated. We evaluate our proposed method by simulation.
-
a simulation model for evaluating the impact of communication services in a functional block based network Protocol Graph
Annual Simulation Symposium, 2012Co-Authors: Daniel Gunther, Nathan Kerr, Paul MullerAbstract:A flexible Future Internet Architecture based on functional blocks will allow the use of different mechanisms to fulfill emerging communication requirements. With this freedom of choice, we can make use of application requirements and system constraints to choose the best Protocol Graph. Each available block impacts the quality of the Protocol Graph. How then can the given requirements and constraints be used to determine which block to use? In this paper we present a simulation model to evaluate the impact of network communication services to decide if a block or a set of blocks composed into a Protocol Graph is able to fulfill the given application requirements and system constraints. The results gained by simulating our presented model show that it is possible to select an appropriate mechanism by matching the application requirements with given offers.
Michael Collins - One of the best experts on this subject based on the ideXlab platform.
-
a Protocol Graph based anomaly detection system
2008Co-Authors: Michael CollinsAbstract:Anomaly detection systems offer the potential to identify new attacks before signatures are identified. To do so, these systems build models of normal user activity from historical data and then use these models to identify deviations from normal behavior caused by attacks. In this thesis, we develop a method of anomaly detection using Protocol Graphs, Graph-based representations of network traffic. These Protocol Graphs model the social relationships between clients and servers, allowing us to identify clever attackers who have a hit list of targets, but don’t understand the relationships these targets have to each other. While this method can identify subtle attacks, anomaly detection systems and IDS in general are challenged by the rise of large-scale industrialized attacks conducted by botnets. The attackers who use botnets have an active interest in acquiring new hosts, leading to a general form of attack we refer to as harvesting. Harvesting attacks consist of a constant stream of low-success high-volume attempts to take over multiple hosts. Because attackers face relatively little risk of detection, harvesting attacks are conducted continuously. These attacks result in a constant stream of garbage traffic that can mistrain an anomaly detector, if the detector assumes that attacks are rare. Furthermore, since harvesting attacks have such a low success rate, they generally represent minimal risk to a network, treating all attacks as equivalent raises the alarm rate extensively even when the attacks represent little risk to the systems that the anomaly detector monitors. To that end, we complement our anomaly detection system by developing
Dimitrios Tzovaras - One of the best experts on this subject based on the ideXlab platform.
-
border gateway Protocol Graph detecting and visualising internet routing anomalies
Iet Information Security, 2016Co-Authors: Stavros Papadopoulos, Konstantinos Moustakas, Anastasios Drosou, Dimitrios TzovarasAbstract:Border gateway Protocol (BGP) is the main Protocol used on the Internet today, for the exchange of routing information between different networks. The lack of authentication mechanisms in BGP, render it vulnerable to prefix hijacking attacks, which raise serious security concerns regarding both service availability and data privacy. To address these issues, this study presents BGPGraph, a scheme for detecting and visualising Internet routing anomalies. In particular, BGPGraph introduces a novel BGP anomaly metric that quantifies the degree of anomaly on the BGP activity, and enables the analyst to obtain an overview of the BGP status. The analyst, is afterwards able to focus on significant time windows for further analysis, by using a hierarchical Graph visualisation scheme. Furthermore, BGPGraph uses a novel method for the quantification of information visualisation that allows for the evaluation, and optimal selection of parameters, in case of the corresponding visual analytics algorithms. As a result, by utilising the proposed approach, four new BGP anomalies were able to be identified. Experimental demonstration in known BGP events, illustrates the significant analytics potential of the proposed approach in terms of identifying prefix hijacks and performing root cause analysis.
