{"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}
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.