A Pareto frontier for node survivable computer network design problem

被引:1
|
作者
Hadian, Ali [1 ]
Bagherian, Mehri [2 ]
机构
[1] Univ Guilan, Dept Appl Math, Univ Campus 2, Rasht, Iran
[2] Univ Guilan, Dept Appl Math, Fac Math Sci, Rasht, Iran
关键词
Mathematical optimization; Survivable network design problem; Two-objective optimization; MULTIOBJECTIVE OPTIMIZATION; SUPPLY CHAIN; BRANCH; ALGORITHM; MODEL; LANE;
D O I
10.1007/s11235-020-00713-6
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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
页数:19
相关论文
共 50 条
  • [21] The Pareto Frontier of Inefficiency in Mechanism Design
    Filos-Ratsikas, Aris
    Giannakopoulos, Yiannis
    Lazos, Philip
    [J]. WEB AND INTERNET ECONOMICS, WINE 2019, 2019, 11920 : 186 - 199
  • [22] On the hop-constrained survivable network design problem with reliable edges
    Botton, Quentin
    Fortz, Bernard
    Gouveia, Luis
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 64 : 159 - 167
  • [23] RETRACTED ARTICLE: On the survivable network design problem with mixed connectivity requirements
    Elham Sadeghi
    Neng Fan
    [J]. Annals of Operations Research, 2023, 326 : 623 - 623
  • [24] Survivable capacitated network design problem:: new formulation and Lagrangean relaxation
    Ríos, M
    Marianov, V
    Gutierrez, M
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2000, 51 (05) : 574 - 582
  • [25] Two-Edge Disjoint Survivable Network Design Problem with Relays
    Konak, Abdullah
    Kulturel-Konak, Sadan
    Smith, Alice E.
    [J]. OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, : 279 - +
  • [26] Hop-constrained node survivable network design:: An application to MPLS over WDM
    Gouveia, Luis
    Patricio, Pedro
    de Sousa, Amaro
    [J]. NETWORKS & SPATIAL ECONOMICS, 2008, 8 (01): : 3 - 21
  • [27] Incremental survivable network design against node failure in SDH/SONET mesh networks
    Qingshan Li
    Xiaoping Zheng
    Wenda Ni
    Yanhe Li
    Hanyi Zhang
    [J]. Photonic Network Communications, 2012, 23 : 25 - 32
  • [28] COMPACT MODELS FOR HOP-CONSTRAINED NODE SURVIVABLE NETWORK DESIGN: AN APPLICATION TO MPLS
    Gouveia, Luis
    Patricio, Pedro
    de Sousa, Amaro
    [J]. 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
    Li, Qingshan
    Zheng, Xiaoping
    Ni, Wenda
    Li, Yanhe
    Zhang, Hanyi
    [J]. PHOTONIC NETWORK COMMUNICATIONS, 2012, 23 (01) : 25 - 32
  • [30] Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra
    Diarrassouba, Ibrahima
    Kutucu, Hakan
    Mahjoub, A. Ridha
    [J]. NETWORKS, 2016, 67 (04) : 316 - 337