Topological resilience analysis of supply networks under random disruptions and targeted attacks

Wenjun Wang, W. Street, Renato E. deMatta
{"title":"Topological resilience analysis of supply networks under random disruptions and targeted attacks","authors":"Wenjun Wang, W. Street, Renato E. deMatta","doi":"10.1145/2808797.2809325","DOIUrl":null,"url":null,"abstract":"Along with the rapid advancement of information technology, the traditional hierarchical supply chain has been quickly evolving into a variety of supply networks, which usually incorporate a large number of entities into complex graph topologies. The study of the resilience of supply networks is an important challenge. In this paper, we exploit the resilience embedded in the network topology by investigating in depth the multiple-path reachability of each demand node to other nodes, and propose a novel network resilience metric. We also develop new supply-network growth mechanisms that reflect the heterogeneous roles of different types of nodes in the supply network. We incorporate them into two fundamental network topologies (i.e. random-graph network and scale-free network), and evaluate their resilience against both random disruptions and targeted attacks using the new resilience metric. The experimental results verify the validity of our resilience metric and the effectiveness of our growth model. This research provides a generic framework and important insights into the construction and resilience analysis of complex supply networks.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2808797.2809325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Along with the rapid advancement of information technology, the traditional hierarchical supply chain has been quickly evolving into a variety of supply networks, which usually incorporate a large number of entities into complex graph topologies. The study of the resilience of supply networks is an important challenge. In this paper, we exploit the resilience embedded in the network topology by investigating in depth the multiple-path reachability of each demand node to other nodes, and propose a novel network resilience metric. We also develop new supply-network growth mechanisms that reflect the heterogeneous roles of different types of nodes in the supply network. We incorporate them into two fundamental network topologies (i.e. random-graph network and scale-free network), and evaluate their resilience against both random disruptions and targeted attacks using the new resilience metric. The experimental results verify the validity of our resilience metric and the effectiveness of our growth model. This research provides a generic framework and important insights into the construction and resilience analysis of complex supply networks.
随机中断和目标攻击下供应网络拓扑弹性分析
随着信息技术的飞速发展,传统的层次化供应链已迅速演变为各种各样的供应网络,这些网络通常将大量实体整合到复杂的图拓扑结构中。供应网络弹性的研究是一个重要的挑战。在本文中,我们通过深入研究每个需求节点到其他节点的多路径可达性,利用嵌入在网络拓扑中的弹性,提出了一种新的网络弹性度量。我们还开发了新的供应网络增长机制,反映了供应网络中不同类型节点的异构角色。我们将它们合并到两个基本的网络拓扑中(即随机图网络和无标度网络),并使用新的弹性度量来评估它们对随机中断和目标攻击的弹性。实验结果验证了弹性度量的有效性和增长模型的有效性。本研究为复杂供应网络的构建和弹性分析提供了一个通用框架和重要见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信