Routing Based on Security

2014 ◽  
pp. 365-380
Author(s):  
I. A. Almerhag
Keyword(s):  
Network Security ◽  
Standard Method ◽  
Blocking Probability ◽  
Computational Effort ◽  
Routing Algorithms ◽  
Measure Data ◽  
Security Metrics ◽  
Essential Requirement ◽  
Blocking Probabilities ◽  
Common Technique

Even though it is an essential requirement of any computer system, there is not yet a standard method to measure data security, especially when sending information over a network. However, the most common technique used to achieve the three goals of security is encryption. Three security metrics are derived from important issues of network security in this chapter. Each metric demonstrates the level of achievement in preserving one of the security goals. Routing algorithms based on these metrics are implemented to test the proposed solution. Computational effort and blocking probability are used to assess the behavior and the performance of these routing algorithms. Results show that the algorithms are able to find feasible paths between communicating parties and make reasonable savings in the computational effort needed to find an acceptable path. Consequently, higher blocking probabilities are encountered, which is the price to be paid for such savings.

scholarly journals Best candidate routing algorithms integrated with minimum processing time and low blocking probability for modern parallel computing systems

2020 ◽  
Vol 19 (2) ◽  
pp. 847 ◽  
Author(s):  
Aadel M. Alatwi ◽  
Ahmed Nabih Zaki Rashed ◽  
Ahmed M. El-Eraki ◽  
Iraj Sadegh Amiri
Keyword(s):  
Parallel Computing ◽  
Processing Time ◽  
Blocking Probability ◽  
Routing Algorithms ◽  
Sequential Algorithm ◽  
Computing Systems ◽  
Processing Times ◽  
Blocking Probabilities ◽  
Window Method ◽  
Delay Times

<p>This study has clarified the best candidate routing algorithms integrated with minimum processing times and low blocking probabilities for modern parallel computing systems. Different methods were employed, such as the fast window method (FWM), fast bitwise window method (FBWM), and fast improved window method (FIWM), to upgrade the processing time and reduce the network delay time. In addition, different algorithms were studied such as the fast window ascending, the fast window descending, the fast window sequential algorithm, and the fast window sequential down algorithms; these were studied to show the numerical results of the networks’ blocking probabilities, processing times, and delay times.</p>

Asymptotic Estimates for Blocking Probabilities in a Large Multi-Rate Loss Network

1997 ◽  
Vol 29 (3) ◽  
pp. 806-829 ◽  
Author(s):  
A. Simonian ◽  
J. W. Roberts ◽  
F. Théberge ◽  
R. Mazumdar
Keyword(s):  
Critical Load ◽  
Blocking Probability ◽  
Asymptotic Estimates ◽  
Switched Network ◽  
Blocking Probabilities ◽  
Low Load ◽  
Rate Loss ◽  
Load Conditions

In this paper, asymptotic estimates for the blocking probability of a call pertaining to a given route in a large multi-rate circuit-switched network are given. Concentrating on low load and critical load conditions, these estimates are essentially derived by using probability change techniques applied to the distribution of the number of occupied links. Such estimates for blocking probabilities are also given a uniform expression applicable to both load regimes. This uniform expression is numerically validated via simple examples.

scholarly journals Preliminary Design of a Model-Free Synthetic Sensor for Aerodynamic Angle Estimation for Commercial Aviation

Sensors ◽  
2019 ◽  
Vol 19 (23) ◽  
pp. 5133 ◽  
Author(s):  
Angelo Lerro ◽  
Alberto Brandl ◽  
Manuela Battipede ◽  
Piero Gili
Keyword(s):  
Network Architecture ◽  
Simulated Data ◽  
Flight Test ◽  
Computational Effort ◽  
Unmanned Aircraft ◽  
Measure Data ◽  
Training Strategy ◽  
Model Free ◽  
Design Activities ◽  
Aerodynamic Angle

Heterogeneity of the small aircraft category (e.g., small air transport (SAT), urban air mobility (UAM), unmanned aircraft system (UAS)), modern avionic solution (e.g., fly-by-wire (FBW)) and reduced aircraft (A/C) size require more compact, integrated, digital and modular air data system (ADS) able to measure data from the external environment. The MIDAS project, funded in the frame of the Clean Sky 2 program, aims to satisfy those recent requirements with an ADS certified for commercial applications. The main pillar lays on a smart fusion between COTS solutions and analytical sensors (patented technology) for the identification of the aerodynamic angles. The identification involves both flight dynamic relationships and data-driven state observer(s) based on neural techniques, which are deterministic once the training is completed. As this project will bring analytical sensors on board of civil aircraft as part of a redundant system for the very first time, design activities documented in this work have a particular focus on airworthiness certification aspects. At this maturity level, simulated data are used, real flight test data will be used in the next stages. Data collection is described both for the training and test aspects. Training maneuvers are defined aiming to excite all dynamic modes, whereas test maneuvers are collected aiming to validate results independently from the training set and all autopilot configurations. Results demonstrate that an alternate solution is possible enabling significant savings in terms of computational effort and lines of codes but they show, at the same time, that a better training strategy may be beneficial to cope with the new neural network architecture.

An Approximation Method for Blocking Probabilities in M/D/1/K1→ ⋅/D/1/K2Queues

2015 ◽  
Vol 32 (03) ◽  
pp. 1550017 ◽  
Author(s):  
Dong-Won Seo ◽  
Jinpyo Lee ◽  
Byeong-Yun Chang
Keyword(s):  
Approximation Method ◽  
Blocking Probability ◽  
Waiting Times ◽  
Tail Probability ◽  
System Structure ◽  
Finite Buffer ◽  
Tandem Queue ◽  
Policy System ◽  
Blocking Probabilities ◽  
The Difference

Obtaining exact blocking probabilities for tandem queues with finite capacities is not a trivial problem. In this paper, we propose a computational approximation method using max-plus algebra for computing blocking probability in a Poisson-driven 2-node tandem queue with finite capacities and constant service times. The blocking probability of a finite-capacity queueing system can be obtained from either the tail probability of stationary waiting time or the difference between two expected stationary waiting times at the first node of the corresponding extended 3-node tandem queue. The computational results in this study show that the proposed approach provides a good approximation of the blocking probability, and in particular, it works well under moderately to heavily loaded situations. The proposed approach is not limited to a particular blocking policy, system structure, or service time; hence, it is applicable to general queues with finite buffer capacities and various blocking policies.

scholarly journals Security Metric Methods for Network Multistep Attacks Using AMC and Big Data Correlation Analysis

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Hao Hu ◽  
Yuling Liu ◽  
Hongqi Zhang ◽  
Yuchen Zhang
Keyword(s):  
Big Data ◽  
Network Security ◽  
Correlation Analysis ◽  
Transition Probability ◽  
Success Probability ◽  
Transition Probability Matrix ◽  
Data Correlation ◽  
Security Metrics ◽  
Proposed Model ◽  
Attack Scenario

Network security metrics allow quantitatively evaluating the overall resilience of networked systems against attacks. From this aim, security metrics are of great importance to the security-related decision-making process of enterprises. In this paper, we employ absorbing Markov chain (AMC) to estimate the network security combining with the technique of big data correlation analysis. Specifically, we construct the model of AMC using a large amount of alert data to describe the scenario of multistep attacks in the real world. In addition, we implement big data correlation analysis to generate the transition probability matrix from alert stream, which defines the probabilities of transferring from one attack action to another according to a given scenario before reaching one of some attack targets. Based on the probability reasoning, two metric algorithms are designed to estimate the attack scenario as well as the attackers, namely, the expected number of visits (ENV) and the expected success probability (ESP). The superiority is that the proposed model and algorithms assist the administrator in building new scenarios, prioritizing alerts, and ranking them.

Sign in / Sign up

Export Citation Format

Share Document