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 条
  • [1] A Pareto frontier for node survivable computer network design problem
    Ali Hadian
    Mehri Bagherian
    [J]. Telecommunication Systems, 2021, 76 : 371 - 389
  • [2] Heuristics for the survivable network design problem
    Han, CG
    Lee, TJ
    [J]. IC'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTERNET COMPUTING, 2000, : 173 - 177
  • [3] The Parameterized Complexity of the Survivable Network Design Problem
    Feldmann, Andreas Emil
    Mukherjee, Anish
    van Leeuwen, Erik Jan
    [J]. 2022 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2022, : 37 - 56
  • [4] The Parameterized Complexity of the Survivable Network Design Problem
    Feldmann, Andreas Emil
    Mukherjee, Anish
    van Leeuwen, Erik Jan
    [J]. arXiv, 2021,
  • [5] Solving the steiner two-node-survivable network problem
    Amoza, Franco Robledo
    [J]. ICIL 2006: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON INDUSTRIAL LOGISTICS, 2006, : 220 - 230
  • [6] Survivable network design: the capacitated minimum spanning network problem
    Jothi, R
    Raghavachari, B
    [J]. INFORMATION PROCESSING LETTERS, 2004, 91 (04) : 183 - 190
  • [7] A note on approximating the survivable network design problem in hypergraphs
    Zhao, Liang
    Nagamochi, Hiroshi
    Ibaraki, Toshihide
    [J]. IEICE Transactions on Information and Systems, 2002, E85-D (02) : 322 - 326
  • [8] Integrally indecomposable polytopes and the survivable network design problem
    Eisenschmidt, Elke
    Koeppe, Matthias
    [J]. DRCN: 2007 6TH INTERNATIONAL WORKSHOP ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS, 2007, : 147 - 154
  • [9] An Approach to Solving the Survivable Capacitated Network Design Problem
    Sridhar, Varadharajan
    Park, June Sung
    [J]. INTERNATIONAL JOURNAL OF BUSINESS DATA COMMUNICATIONS AND NETWORKING, 2005, 1 (02) : 1 - 16
  • [10] A note on approximating the survivable network design problem in hypergraphs
    Zhao, L
    Nagamochi, H
    Ibaraki, T
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (02): : 322 - 326