• Title/Summary/Keyword: Network robustness

Search Result 498, Processing Time 0.034 seconds

Measuring the Impact of Supply Network Topology on the Material Delivery Robustness in Construction Projects

  • Heo, Chan;Ahn, Changbum;Yoon, Sungboo;Jung, Minhyeok;Park, Moonseo
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.269-276
    • /
    • 2022
  • The robustness of a supply chain (i.e., the ability to cope with external and internal disruptions and disturbances) becomes more critical in ensuring the success of a construction project because the supply chain of today's construction project includes more and diverse suppliers. Previous studies indicate that topological features of the supply chain critically affect its robustness, but there is still a great challenge in characterizing and quantifying the impact of network topological features on its robustness. In this context, this study aims to identify network measures that characterize topological features of the supply chain and evaluate their impact on the robustness of the supply chain. Network centrality measures that are commonly used in assessing topological features in social network analysis are identified. Their validity in capturing the impact on the robustness of the supply chain was evaluated through an experiment using randomly generated networks and their simulations. Among those network centrality measures, the PageRank centrality and its standard deviation are found to have the strongest association with the robustness of the network, with a positive correlation coefficient of 0.6 at the node level and 0.74 at the network level. The findings in this study allows for the evaluation of the supply chain network's robustness based only on its topological design, thereby enabling practitioners to better design a robust supply chain and easily identify vulnerable links in their supply chains.

  • PDF

Enhancing the Robustness and Efficiency of Scale-free Network with Limited Link Addition

  • Li, Li;Jia, Qing-Shan;Guan, Xiaohong;Wang, Hengtao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1333-1353
    • /
    • 2012
  • The robustness of a network is usually measured by error tolerance and attack vulnerability. Significant research effort has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we investigate how to optimize attack tolerance and communication efficiency of an existing network under the limited link addition. A survival fitness metric is defined to measure both the attack tolerance and the communication efficiency of the network. We show that network topology reconfiguration optimization with limited link addition (NTRLA) problem is NP-hard. Two approximate solution methods are developed. First, we present a degree-fitness parameter to guide degree-based link addition method. Second, a preferential configuration node-protecting cycle (PCNC) method is developed to do trade-off between network robustness and efficiency. The performance of PCNC method is demonstrated by numerical experiments.

Robustness Evaluation of Tactical Network based on SNA

  • Park, Ji-Hye;Yoon, Soung-woong;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.10
    • /
    • pp.205-213
    • /
    • 2019
  • Network robustness is one of the most important characteristics needed as the network. Over the military tactical communication network, robustness is a key function for maintaining attack phase constantly. Tactical Information Communication Network, called TICN, has mixed characteristics of lattice- and tree-type network topology, which looks somewhat weak in the viewpoint of network robustness. In this paper, we search articulation points and bridges in a current Tactical Information Communication Network using graph theory. To improve the weak points empirically searched, we try to add links to create the concrete network and then observe the change of network-based verification values through diminishing nodes. With these themes, we evaluate the generated networks through SNA techniques. Experimental results show that the generated networks' robustness is improved compared with current network structure.

A Robustness Analysis of Korea Expressway Network

  • Lee, Sung-Geun;Han, Chi-Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.4
    • /
    • pp.85-91
    • /
    • 2021
  • Some sections of the highway are closed due to disasters and accidents. In this situation, it analyzes what kind of situation occurs due to functional failure in the highway network. The domestic highway network can be expressed as a graph. Blocking some sections of the highway can turn into a national disaster. In this paper, we analyze the robustness of the domestic highway network. The robustness of expressways refers to the degree to which the traffic conditions of the domestic expressway network deteriorate due to the blockage of some sections. The greater the robustness, the smaller the effect of some blocking appears. This study is used to evaluate the congestion level of one section of the transportation network, and a value obtained by dividing the section traffic volume (V) by the section traffic volume (C) is used. This study analyzes the robustness of highways by using the actual traffic volume data of the departure and arrival points of domestic highways, and analyzes the changes in traffic volume due to partial blockage through experimental calculations. Although this analysis cannot reflect the exact reality of domestic highways, it is judged to be sufficient for the purpose of confirming the basic robustness of the overall network.

Optimal Network Design for Enhancing the Precision of National Geodetic Network (국가 측지망의 정밀도 향상을 위한 최적 측지망 설계에 관한 연구)

  • Cho, Jae-Myoung;Yun, Hong-Sik;Wie, Gwang-Jae
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.28 no.6
    • /
    • pp.587-594
    • /
    • 2010
  • This paper describe the optimal design of geodetic network by analytical technique based on the quality criteria of network. We described an example of geodetic network design taking into account the precision, reliability and robustness that are the main criteria of network design. The main goal of this paper is to evaluate the criteria to design the geodetic network coinciding with the criteria of high precision(error ellipse, 2DRMS, CEP), reliability(internal and external reliability) and robustness(maximum shear strain, principal strain, dilatation). The network design parameters computed in this study show that precision and reliability has not much improved by about 2% and 3%, respectively, than the observed network, while robustness has much improved by about 3, 100%. It also shown that maximum errors of precision, reliability and robustness were reduced by 5%, 7% and 16,957%, respectively.

A Study on the Robustness of the Bitcoin Lightning Network (Bitcoin Lightning Network의 강건성에 대한 연구)

  • Lee, Seung-jin;Kim, Hyoung-shick
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.4
    • /
    • pp.1009-1019
    • /
    • 2018
  • Bitcoin is the first application utilizing the blockchain, but it has limitations in terms of scalability. The concept of Lightning Network was recently introduced to address the scalability problem of Bitcoin. In this paper, we found that the real-world Bitcoin Lightning Network shows the scale-free property. Therefore, the Bitcoin Lightning Network can be vulnerable to the intentional attacks targeting some specific nodes in the network while it is still robust to the random node failures. We experimentally analyze the robustness of the Bitcoin's Lightning Network via the simulation of network attack model. Our simulation results demonstrate that the real-world Lightning Network is vulnerable to target attacks that destroy a few nodes with high degree.

Analysis of the network robustness based on the centrality of vertices in the graph

  • Jeong, Changkwon;Han, Chi-Geun;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.3
    • /
    • pp.61-67
    • /
    • 2017
  • This paper analyzes the robustness of the network based on the centrality of vertices in the graph. In this paper, a random graph is generated and a modified graph is constructed by adding or removing vertices or edges in the generated random graph. And then we analyze the robustness of the graph by observing changes in the centrality of the random graph and the modified graph. In the process modifying a graph, we changes some parts of the graph, which has high values of centralities, not in the whole. We study how these additional changes affect the robustness of the graph when changes occurring a group that has higher centralities than in the whole.

Adaptive Neural Network Control for Robot Manipulators

  • Lee, Min-Jung;Choi, Young-Kiu
    • KIEE International Transaction on Systems and Control
    • /
    • v.12D no.1
    • /
    • pp.43-50
    • /
    • 2002
  • In the recent years neural networks have fulfilled the promise of providing model-free learning controllers for nonlinear systems; however, it is very difficult to guarantee the stability and robustness of neural network control systems. This paper proposes an adaptive neural network control for robot manipulators based on the radial basis function netwo.k (RBFN). The RBFN is a branch of the neural networks and is mathematically tractable. So we adopt the RBFN to approximate nonlinear robot dynamics. The RBFN generates control input signals based on the Lyapunov stability that is often used in the conventional control schemes. The saturation function is also chosen as an auxiliary controller to guarantee the stability and robustness of the control system under the external disturbances and modeling uncertainties.

  • PDF

The Effects of Feedback Loops on the Network Robustness by using a Random Boolean Network Model (랜덤 불리언 네트워크 모델을 이용한 되먹임 루프가 네트워크 강건성에 미치는 영향)

  • Kwon, Yung-Keun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.3
    • /
    • pp.138-146
    • /
    • 2010
  • It is well known that many biological networks are very robust against various types of perturbations, but we still do not know the mechanism of robustness. In this paper, we find that there exist a number of feedback loops in a real biological network compared to randomly generated networks. Moreover, we investigate how the topological property affects network robustness. To this end, we properly define the notion of robustness based on a Boolean network model. Through extensive simulations, we show that the Boolean networks create a nearly constant number of fixed-point attractors, while they create a smaller number of limit-cycle attractors as they contain a larger number of feedback loops. In addition, we elucidate that a considerably large basin of a fixed-point attractor is generated in the networks with a large number of feedback loops. All these results imply that the existence of a large number of feedback loops in biological networks can be a critical factor for their robust behaviors.

An Analysis of the Ripple Effect of Congestion in a Specific Section Using the Robustness Sensitivity of the Traffic Network

  • Chi-Geun Han;Sung-Geun Lee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.4
    • /
    • pp.83-91
    • /
    • 2023
  • In this paper, we propose a robustness sensitivity index (RSI) of highway networks to analyze the effect of congestion in a specific section on the entire highway. The newly proposed RSI is defined as the change in the total mileage of the transportation network per extended unit length when the length of a particular section is extended. When the RSI value is large, traffic congestion in the section has a worse effect on the entire network than in other sections. The existing network robustness index (NRI) simply observes changes in transportation networks with and without specific sections, but the RSI proposed in this study is a kind of performance indicator that allows quantitative analysis of the ripple effect of the entire network according to the degree of congestion in a specific section. While changing the degree of congestion in a particular section, it is possible to calculate how the traffic volume increases, decreases, and the size and location of the congestion section change. This analysis proves the superiority of RSI as it cannot be analyzed with NRI. Various properties of RSI are analyzed using data from the domestic highway network. In addition, using the RSI concept, it is shown that the ripple effect on other sections in which a change in the degree of congestion of a specific section occurs can be analyzed.