A Pareto frontier for node survivable computer network design problem

被引:0
|
作者
Ali Hadian
Mehri Bagherian
机构
[1] University of Guilan,Department of Applied Mathematics, University Campus 2
[2] University of Guilan,Department of Applied Mathematics, Faculty of Mathematical Sciences
来源
Telecommunication Systems | 2021年 / 76卷
关键词
Mathematical optimization; Survivable network design problem; Two-objective optimization;
D O I
暂无
中图分类号
学科分类号
摘要
In a survivable network design problem in cloud computing, one important goal is minimizing the network building costs, and the other important goal is maximizing the technical capability of the network. The literature investigation shows that the previous studies for computer network design proposed models only considering one of the above-mentioned goals and neglected the other. In this paper, a new model is developed in which the node survivable network design problem is formulated as a two-objective optimization problem considering both goals. To solve the formulated problem, several two-objective optimization procedures are adopted and the results are discussed. Finally, numerical simulations are performed for two real examples and the obtained results are discussed.
引用
收藏
页码:371 / 389
页数:18
相关论文
共 50 条
  • [21] The Pareto Frontier of Inefficiency in Mechanism Design
    Filos-Ratsikas, Aris
    Giannakopoulos, Yiannis
    Lazos, Philip
    WEB AND INTERNET ECONOMICS, WINE 2019, 2019, 11920 : 186 - 199
  • [22] Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
    Botton, Quentin
    Fortz, Bernard
    Gouveia, Luis
    Poss, Michael
    INFORMS JOURNAL ON COMPUTING, 2013, 25 (01) : 13 - 26
  • [23] On the hop-constrained survivable network design problem with reliable edges
    Botton, Quentin
    Fortz, Bernard
    Gouveia, Luis
    COMPUTERS & OPERATIONS RESEARCH, 2015, 64 : 159 - 167
  • [24] RETRACTED ARTICLE: On the survivable network design problem with mixed connectivity requirements
    Elham Sadeghi
    Neng Fan
    Annals of Operations Research, 2023, 326 : 623 - 623
  • [25] Survivable capacitated network design problem:: new formulation and Lagrangean relaxation
    Ríos, M
    Marianov, V
    Gutierrez, M
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2000, 51 (05) : 574 - 582
  • [26] Two-Edge Disjoint Survivable Network Design Problem with Relays
    Konak, Abdullah
    Kulturel-Konak, Sadan
    Smith, Alice E.
    OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, : 279 - +
  • [27] Hop-constrained node survivable network design:: An application to MPLS over WDM
    Gouveia, Luis
    Patricio, Pedro
    de Sousa, Amaro
    NETWORKS & SPATIAL ECONOMICS, 2008, 8 (01): : 3 - 21
  • [28] COMPACT MODELS FOR HOP-CONSTRAINED NODE SURVIVABLE NETWORK DESIGN: AN APPLICATION TO MPLS
    Gouveia, Luis
    Patricio, Pedro
    de Sousa, Amaro
    TELECOMMUNICATIONS PLANNING : INNOVATIONS IN PRICING, NETWORK DESIGN AND MANAGEMENT, 2006, 33 : 167 - 180
  • [29] Incremental survivable network design against node failure in SDH/SONET mesh networks
    Qingshan Li
    Xiaoping Zheng
    Wenda Ni
    Yanhe Li
    Hanyi Zhang
    Photonic Network Communications, 2012, 23 : 25 - 32
  • [30] Incremental survivable network design against node failure in SDH/SONET mesh networks
    Li, Qingshan
    Zheng, Xiaoping
    Ni, Wenda
    Li, Yanhe
    Zhang, Hanyi
    PHOTONIC NETWORK COMMUNICATIONS, 2012, 23 (01) : 25 - 32