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 条
  • [31] Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra
    Diarrassouba, Ibrahima
    Kutucu, Hakan
    Mahjoub, A. Ridha
    NETWORKS, 2016, 67 (04) : 316 - 337
  • [32] Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM
    Luís Gouveia
    Pedro Patrício
    Amaro de Sousa
    Networks and Spatial Economics, 2008, 8 : 3 - 21
  • [33] Polynomial-time approximation schemes for the Euclidean survivable network design problem
    Czumaj, A
    Lingas, A
    Zhao, HR
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 973 - 984
  • [34] Valid inequalities and facets for multi-module survivable network design problem
    Luo, Haochen
    Kianfar, Kiavash
    NETWORKS, 2023, 81 (02) : 155 - 176
  • [35] Separation of partition inequalities for the (1,2)-survivable network design problem
    Kerivin, H
    Mahjoub, AR
    OPERATIONS RESEARCH LETTERS, 2002, 30 (04) : 265 - 268
  • [36] A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands
    Bang-Jensen, Jørgen
    Klinkby, Kristine Vitting
    Misra, Pranabendu
    Saurabh, Saket
    Leibniz International Proceedings in Informatics, LIPIcs, 2023, 274
  • [37] A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
    Zhao, L
    Nagamochi, H
    Ibaraki, T
    DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 275 - 289
  • [38] Survivable Network Design and Optimization with Network Families
    Todd, Brody
    Ibigbami, Abiose
    Doucette, John
    JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS, 2014, 2014
  • [39] Analysing the factors that influence the Pareto frontier of a bi-objective supply chain design problem
    Palacio, Antonio
    Adenso-Diaz, Belarmino
    Lozano, Sebastian
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (06) : 1717 - 1738
  • [40] Price of Stability in Survivable Network Design
    Anshelevich, Elliot
    Caskurlu, Bugra
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (01) : 98 - 138