Identifying multiple vulnerable areas of infrastructure network under global connectivity measure

2019 ◽  
Vol 30 (07) ◽  
pp. 1940004 ◽  
Author(s):  
Ke Wang ◽  
Yong Li ◽  
Jun Wu

Infrastructure networks provide significant services for our society. Nevertheless, high dependence on physical infrastructures makes infrastructure networks vulnerable to disasters or intentional attacks which being considered as geographically related failures that happened in specific geographical locations and result in failures of neighboring network components. To provide comprehensive network protection against failures, vulnerability of infrastructure network needs to be assessed with various network performance measures. However, when considering about multiple vulnerable areas, available researches just employ measure of total number of affected edges while neglecting edges’ different topologies. In this paper, we focus on identifying multiple vulnerable areas under global connectivity measure: Size Ratio of the Giant Component (SRGC). Firstly, Deterministic Damage Circle Model and Multiple Barycenters Method are presented to determine damage impact and location of damage region. For solving the HP-hard problem of identifying multiple optimal attacks, we transform the problem into combinational optimization problem and propose a mixed heuristic strategy consisted of both Greedy Algorithm and Genetic Algorithm to attain the optimal solution. We obtain numerical results for real-world infrastructure network, thereby demonstrating the effectiveness and applicability of the presented strategy and algorithms. The distinctive results of SRGC indicate the necessity and significance of considering global connectivity measure in assessing vulnerability of infrastructure networks.

2017 ◽  
Author(s):  
◽  
Gokhan Karakose

[ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT REQUEST OF AUTHOR.] The identification of critical network components is of interest to both interdictors wishing to degrade the network's performance, and to defenders aiming to preserve network performance in the face of disruption. This dissertation focuses on methods for identifying critical subsets of nodes and/or arcs to fortify and/or disable for the purpose of network protection. A common link connecting all studies in this dissertation is our incorporation of the multi-commodity flow formulations into larger multi-level (e.g., minimax) optimization models. ... The last study examines network fortification models that are able to differentiate between failures that are random (e.g., caused by nature) and strategic network failures (e.g., caused by terrorist activities) when performing the allocation of protective resources. This distinction cannot be achieved in the models presented previously in this dissertation. The desired properties of such differentiating formulations are derived by specifying a set of priori assumptions. The criticality indexes in these models, which are necessary to assess the impact of a disruption, are pre-computed through the resolution of the multi-commodity based User Equilibrium (UE) traffic assignment model and applied to urban transportation networks. Novel valid inequalities and linearization techniques are applied to the dual version of the nonlinear UE multi-commodity model to improve its computational efficiency. Computational results demonstrate that the reformulated linear dual model is effective to solve large size instances to near-optimality; and that the optimal allocation of resources as identified by a component-based formulation may potentially be suboptimal when a network is at risk of multiple simultaneous failures for both types of disruptions (i.e., nature- and terrorist-based). We also demonstrate that fortification models for component or scenario-based disruptions can provide different resource allocations for both types of disruptions.


Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5164
Author(s):  
Changsun Shin ◽  
Meonghun Lee

The swarm intelligence (SI)-based bio-inspired algorithm demonstrates features of heterogeneous individual agents, such as stability, scalability, and adaptability, in distributed and autonomous environments. The said algorithm will be applied to the communication network environment to overcome the limitations of wireless sensor networks (WSNs). Herein, the swarm-intelligence-centric routing algorithm (SICROA) is presented for use in WSNs that aim to leverage the advantages of the ant colony optimization (ACO) algorithm. The proposed routing protocol addresses the problems of the ad hoc on-demand distance vector (AODV) and improves routing performance via collision avoidance, link-quality prediction, and maintenance methods. The proposed method was found to improve network performance by replacing the periodic “Hello” message with an interrupt that facilitates the prediction and detection of link disconnections. Consequently, the overall network performance can be further improved by prescribing appropriate procedures for processing each control message. Therefore, it is inferred that the proposed SI-based approach provides an optimal solution to problems encountered in a complex environment, while operating in a distributed manner and adhering to simple rules of behavior.


Urban Studies ◽  
2010 ◽  
Vol 47 (9) ◽  
pp. 1969-1984 ◽  
Author(s):  
Sandra Vinciguerra ◽  
Koen Frenken ◽  
Marco Valente

In this paper, the evolution of infrastructure networks is modelled as a preferential attachment process. It is assumed that geographical distance and country borders provide barriers to link formation in infrastructure networks. The model is validated against empirical data on the European Internet infrastructure network covering 209 cities. The average path length and average clustering coefficient of the observed network are successfully simulated. Furthermore, the simulated network shows a significant correlation with the observed European Internet infrastructure network. The paper ends with a discussion on the future uses of preferential attachment models in the light of the literature on world cities and global cities.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Ziqiang Li ◽  
Xianfeng Wang ◽  
Jiyang Tan ◽  
Yishou Wang

Packing orthogonal unequal rectangles in a circle with a mass balance (BCOURP) is a typical combinational optimization problem with the NP-hard nature. This paper proposes an effective quasiphysical and dynamic adjustment approach (QPDAA). Two embedded degree functions between two orthogonal rectangles and between an orthogonal rectangle and the container are defined, respectively, and the extruded potential energy function and extruded resultant force formula are constructed based on them. By an elimination of the extruded resultant force, the dynamic rectangle adjustment, and an iteration of the translation, the potential energy and static imbalance of the system can be quickly decreased to minima. The continuity and monotony of two embedded degree functions are proved to ensure the compactness of the optimal solution. Numerical experiments show that the proposed QPDAA is superior to existing approaches in performance.


Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 311 ◽  
Author(s):  
Hai Xue ◽  
Kyung Kim ◽  
Hee Youn

Load Balancing (LB) is one of the most important tasks required to maximize network performance, scalability and robustness. Nowadays, with the emergence of Software-Defined Networking (SDN), LB for SDN has become a very important issue. SDN decouples the control plane from the data forwarding plane to implement centralized control of the whole network. LB assigns the network traffic to the resources in such a way that no one resource is overloaded and therefore the overall performance is maximized. The Ant Colony Optimization (ACO) algorithm has been recognized to be effective for LB of SDN among several existing optimization algorithms. The convergence latency and searching optimal solution are the key criteria of ACO. In this paper, a novel dynamic LB scheme that integrates genetic algorithm (GA) with ACO for further enhancing the performance of SDN is proposed. It capitalizes the merit of fast global search of GA and efficient search of an optimal solution of ACO. Computer simulation results show that the proposed scheme substantially improves the Round Robin and ACO algorithm in terms of the rate of searching optimal path, round trip time, and packet loss rate.


2014 ◽  
Vol 631-632 ◽  
pp. 271-275
Author(s):  
Yan Kang ◽  
Zhong Min Wang ◽  
Ying Lin ◽  
Xiang Yun Guo

This paper presents a differential evolution algorithm with designed greedy heuristic strategy to solve the task scheduling problem. The static task scheduling problem is NP-complete and is a critic issue in parallel and distributed computing environment. A vector consists of a task permutation assigned to each individual in the target population by using DE mutation and crossover operators. A heuristic strategy is used to generate the feasible solutions as there a lot of infeasible solutions in the solution space as the size of the problem increase. And the strategies of the particle swarm algorithm are employed to modify the DE crossover operator for speeding up the search to optimal solution. And then, the individual is replaced with the corresponding target individual if it is global best or local best in terms of fitness. The performance of the algorithm is illustrated by comparing with the existing effectively scheduling algorithms. The performances of the proposed algorithms are tested on the benchmark and compared to the best-known solutions available. The computational results demonstrate that effectively and efficiency of the presented algorithm.


2012 ◽  
Vol 588-589 ◽  
pp. 1490-1494 ◽  
Author(s):  
Min Yang ◽  
Ming Yan Jiang

This paper aims to solve the optimization power allocation problem based on cognitive radio network system. We propose a Hybrid Spectrum Access (HSA) method which considers the total transmit power constraint, the peak power constraint and the primary users’ tolerance. In order to solve this combinational optimization problem and achieve the global optimal solution, we derived a Simulated Annealing-Hopfield neural networks (SA-HNN). The simulation results of the optimized ergodic capacity shows that the proposed optimization problem can be solved more efficiently and better by SA-HNN than HNN or Simulated Annealing (SA), and the proposed HSA method by SA-HNN can achieve a better ergodic capacity than the traditional methods.


Author(s):  
Kuangyu Qin ◽  
Bin Fu ◽  
Peng Chen ◽  
Jianhua Huang ◽  
◽  
...  

A software-defined network (SDN) partitions a network into a control plane and data plane. Utilizing centralized control, an SDN can accurately control the routing of data flow. In the network, links have various costs, such as bandwidth, delay, and hops. However, it is difficult to obtain a multicost optimization path. If online rerouting can be realized under multiple cost, then network performance can be improved. This paper proposes a multicost rerouting algorithm for elephant flow, as the latter is the main factor affecting network traffic. By performing path trimming, the algorithm can obtain the approximate optimal solution of (1+e) in polynomial time. Simulation results show that the proposed algorithm yields good performance.


Sign in / Sign up

Export Citation Format

Share Document