预算约束下相互依赖网络的最优互连结构设计

Srinjoy Chattopadhyay, H. Dai
{"title":"预算约束下相互依赖网络的最优互连结构设计","authors":"Srinjoy Chattopadhyay, H. Dai","doi":"10.1109/ICC.2017.7997212","DOIUrl":null,"url":null,"abstract":"In this work, we focus on the problem of obtaining the optimal interlink structures, which maximizes the robustness of networks against random node failures, in a cost constrained setting. Using percolation theory based system equations, we have formulated our objective as a constrained optimization problem and designed algorithms serving two key purposes: i) obtaining the budget limits, Bl and Bu, defined as the minimum budget guaranteeing the existence of a feasible and optimal interlink structure, respectively; and ii) obtaining interlink structures for intermediate budgets. Through these algorithms and associated simulation results, we demonstrate the importance of cost in network design. Furthermore, the designed algorithms have close to optimal performance while being much cheaper than cost agnostic network designs.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"48 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Designing optimal interlink structures for interdependent networks under budget constraints\",\"authors\":\"Srinjoy Chattopadhyay, H. Dai\",\"doi\":\"10.1109/ICC.2017.7997212\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we focus on the problem of obtaining the optimal interlink structures, which maximizes the robustness of networks against random node failures, in a cost constrained setting. Using percolation theory based system equations, we have formulated our objective as a constrained optimization problem and designed algorithms serving two key purposes: i) obtaining the budget limits, Bl and Bu, defined as the minimum budget guaranteeing the existence of a feasible and optimal interlink structure, respectively; and ii) obtaining interlink structures for intermediate budgets. Through these algorithms and associated simulation results, we demonstrate the importance of cost in network design. Furthermore, the designed algorithms have close to optimal performance while being much cheaper than cost agnostic network designs.\",\"PeriodicalId\":6517,\"journal\":{\"name\":\"2017 IEEE International Conference on Communications (ICC)\",\"volume\":\"48 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2017.7997212\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2017.7997212","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在这项工作中,我们专注于在成本约束的情况下获得最优互连结构的问题,该问题最大限度地提高了网络对随机节点故障的鲁棒性。利用基于渗流理论的系统方程,我们将目标定义为约束优化问题,并设计了两个关键目的的算法:1)获得预算极限Bl和Bu,分别定义为保证可行和最优互联结构存在的最小预算;ii)获取中间预算的互连结构。通过这些算法和相关的仿真结果,我们证明了成本在网络设计中的重要性。此外,所设计的算法接近最优性能,同时比成本不可知网络设计便宜得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Designing optimal interlink structures for interdependent networks under budget constraints
In this work, we focus on the problem of obtaining the optimal interlink structures, which maximizes the robustness of networks against random node failures, in a cost constrained setting. Using percolation theory based system equations, we have formulated our objective as a constrained optimization problem and designed algorithms serving two key purposes: i) obtaining the budget limits, Bl and Bu, defined as the minimum budget guaranteeing the existence of a feasible and optimal interlink structure, respectively; and ii) obtaining interlink structures for intermediate budgets. Through these algorithms and associated simulation results, we demonstrate the importance of cost in network design. Furthermore, the designed algorithms have close to optimal performance while being much cheaper than cost agnostic network designs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic control of NFV forwarding graphs with end-to-end deadline constraints New sensing technique for detecting application layer DDoS attacks targeting back-end database resources Using the pattern-of-life in networks to improve the effectiveness of intrusion detection systems On the two time scale characteristics of wireless high speed railway networks Secrecy outage analysis of buffer-aided multi-antenna relay systems without eavesdropper's CSI
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1