Skip to main content
Erschienen in: Telecommunication Systems 3/2021

06.10.2020

A Pareto frontier for node survivable computer network design problem

verfasst von: Ali Hadian, Mehri Bagherian

Erschienen in: Telecommunication Systems | Ausgabe 3/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Pióro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. Amsterdam: Elsevier. Pióro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. Amsterdam: Elsevier.
2.
Zurück zum Zitat Jinno, M., Kozicki, B., Takara, H., Watanabe, A., Sone, Y., Tanaka, T., et al. (2010). Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network (topics in optical communications). IEEE Communications Magazine, 48(8), 138–145.CrossRef Jinno, M., Kozicki, B., Takara, H., Watanabe, A., Sone, Y., Tanaka, T., et al. (2010). Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network (topics in optical communications). IEEE Communications Magazine, 48(8), 138–145.CrossRef
3.
Zurück zum Zitat Carofiglio, G., Morabito, G., Muscariello, L., Solis, I., & Varvello, M. (2013). From content delivery today to information centric networking. Computer Networks, 57(16), 3116–3127.CrossRef Carofiglio, G., Morabito, G., Muscariello, L., Solis, I., & Varvello, M. (2013). From content delivery today to information centric networking. Computer Networks, 57(16), 3116–3127.CrossRef
4.
Zurück zum Zitat Tyson, G., Bodanese, E., Bigham, J., & Mauthe, A. (2014). Beyond content delivery: Can ICNS help emergency scenarios? IEEE Network, 28(3), 44–49.CrossRef Tyson, G., Bodanese, E., Bigham, J., & Mauthe, A. (2014). Beyond content delivery: Can ICNS help emergency scenarios? IEEE Network, 28(3), 44–49.CrossRef
5.
Zurück zum Zitat Tomkos, I., Azodolmolky, S., Sole-Pareta, J., Careglio, D., & Palkopoulou, E. (2014). A tutorial on the flexible optical networking paradigm: State of the art, trends, and research challenges. Proceedings of the IEEE, 102(9), 1317–1337.CrossRef Tomkos, I., Azodolmolky, S., Sole-Pareta, J., Careglio, D., & Palkopoulou, E. (2014). A tutorial on the flexible optical networking paradigm: State of the art, trends, and research challenges. Proceedings of the IEEE, 102(9), 1317–1337.CrossRef
6.
Zurück zum Zitat Simmons, J. M. X. (2014). Optical network design and planning. Berlin: Springer.CrossRef Simmons, J. M. X. (2014). Optical network design and planning. Berlin: Springer.CrossRef
7.
Zurück zum Zitat Mukherjee, B. (2000). WDM optical communication networks: Progress and challenges. IEEE Journal on Selected Areas in Communications, 18(10), 1810–1824.CrossRef Mukherjee, B. (2000). WDM optical communication networks: Progress and challenges. IEEE Journal on Selected Areas in Communications, 18(10), 1810–1824.CrossRef
8.
Zurück zum Zitat Li, Y., King, D., Zhang, F., & Farrel, A. (2015). Generalized labels for the flexi-grid in lambda switch capable (LSC) label switching routers. Li, Y., King, D., Zhang, F., & Farrel, A. (2015). Generalized labels for the flexi-grid in lambda switch capable (LSC) label switching routers.
9.
Zurück zum Zitat REC, I. (1998). Optical interfaces for multichannel systems with optical amplifiers. G. 692, International telecommunication Union Standarization Sector. REC, I. (1998). Optical interfaces for multichannel systems with optical amplifiers. G. 692, International telecommunication Union Standarization Sector.
10.
Zurück zum Zitat Raghavan, S. (1995). Formulations and algorithms for network design problems with connectivity requirements, Doctoral dissertation, Massachusetts Institute of Technology. Raghavan, S. (1995). Formulations and algorithms for network design problems with connectivity requirements, Doctoral dissertation, Massachusetts Institute of Technology.
11.
Zurück zum Zitat Goemans, M. X., & Williamson, D. P. The primal-dual method for approximation algorithms and its application to network design problems. In Approximation algorithms for NP-hard problems, pp. 144–191. Goemans, M. X., & Williamson, D. P. The primal-dual method for approximation algorithms and its application to network design problems. In Approximation algorithms for NP-hard problems, pp. 144–191.
12.
Zurück zum Zitat Ravi, R., Marathe, M. V., Ravi, S. S., Rosenkrantz, D. J., & Hunt, H. B., III. (2001). Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica, 31(1), 58–78.CrossRef Ravi, R., Marathe, M. V., Ravi, S. S., Rosenkrantz, D. J., & Hunt, H. B., III. (2001). Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica, 31(1), 58–78.CrossRef
13.
Zurück zum Zitat Walkowiak, K. (2016). Modeling and optimization of cloud-ready and content-oriented networks (Vol. 56). Berlin: Springer. Walkowiak, K. (2016). Modeling and optimization of cloud-ready and content-oriented networks (Vol. 56). Berlin: Springer.
14.
Zurück zum Zitat Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, applications and algorithms. Englewood Cliffs: Prentice-Hall. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, applications and algorithms. Englewood Cliffs: Prentice-Hall.
15.
Zurück zum Zitat Gibbard, A. (1973). Manipulation of voting schemes: A general result. Econometrica, 41, 587–602.CrossRef Gibbard, A. (1973). Manipulation of voting schemes: A general result. Econometrica, 41, 587–602.CrossRef
16.
Zurück zum Zitat Diarrassouba, I., Mahjoub, M., Mahjoub, A. R., & Yaman, H. (2018). k-node-disjoint hop-constrained survivable networks: Polyhedral analysis and branch and cut. Annals of Telecommunications, 73(1–2), 5–28.CrossRef Diarrassouba, I., Mahjoub, M., Mahjoub, A. R., & Yaman, H. (2018). k-node-disjoint hop-constrained survivable networks: Polyhedral analysis and branch and cut. Annals of Telecommunications, 73(1–2), 5–28.CrossRef
17.
Zurück zum Zitat Atamtürk, A., & Bhardwaj, A. (2018). Network design with probabilistic capacities. Networks, 71(1), 16–30.CrossRef Atamtürk, A., & Bhardwaj, A. (2018). Network design with probabilistic capacities. Networks, 71(1), 16–30.CrossRef
18.
Zurück zum Zitat Mahjoub, A. R., Poss, M., Simonetti, L., & Uchoa, E. (2019). Distance transformation for network design problems. SIAM Journal on Optimization, 29(2), 1687–1713.CrossRef Mahjoub, A. R., Poss, M., Simonetti, L., & Uchoa, E. (2019). Distance transformation for network design problems. SIAM Journal on Optimization, 29(2), 1687–1713.CrossRef
19.
Zurück zum Zitat Gouveia, L., Joyce-Moniz, M., & Leitner, M. (2018). Branch-and-cut methods for the network design problem with vulnerability constraints. Computers & Operations Research, 91, 190–208.CrossRef Gouveia, L., Joyce-Moniz, M., & Leitner, M. (2018). Branch-and-cut methods for the network design problem with vulnerability constraints. Computers & Operations Research, 91, 190–208.CrossRef
20.
Zurück zum Zitat Borne, S., Gourdin, E., Klopfenstein, O., & Mahjoub, A. R. (2018). A branch-and-cut algorithm for the capacitated multi-failure survivable network design problem. Computers & Industrial Engineering, 124, 582–603.CrossRef Borne, S., Gourdin, E., Klopfenstein, O., & Mahjoub, A. R. (2018). A branch-and-cut algorithm for the capacitated multi-failure survivable network design problem. Computers & Industrial Engineering, 124, 582–603.CrossRef
21.
Zurück zum Zitat Chalermsook, P., Das, S., Even, G., Laekhanukit, B., & Vaz, D. (2018). Survivable network design for group connectivity in low-treewidth graphs. arXiv preprint arXiv:1802.10403. Chalermsook, P., Das, S., Even, G., Laekhanukit, B., & Vaz, D. (2018). Survivable network design for group connectivity in low-treewidth graphs. arXiv preprint arXiv:​1802.​10403.
22.
Zurück zum Zitat Bang-Jensen, J., Basavaraju, M., Klinkby, K. V., Misra, P., Ramanujan, M. S., Saurabh, S., & Zehavi, M. (2018). Parameterized algorithms for survivable network design with uniform demands. In Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms (pp. 2838–2850). Society for Industrial and Applied Mathematics. Bang-Jensen, J., Basavaraju, M., Klinkby, K. V., Misra, P., Ramanujan, M. S., Saurabh, S., & Zehavi, M. (2018). Parameterized algorithms for survivable network design with uniform demands. In Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms (pp. 2838–2850). Society for Industrial and Applied Mathematics.
23.
Zurück zum Zitat Rosado, D. G., Fernández-Medina, E., López, J., & Piattini, M. (2011). Systematic design of secure mobile grid systems. Journal of Network and Computer Applications, 34(4), 1168–1183.CrossRef Rosado, D. G., Fernández-Medina, E., López, J., & Piattini, M. (2011). Systematic design of secure mobile grid systems. Journal of Network and Computer Applications, 34(4), 1168–1183.CrossRef
24.
Zurück zum Zitat Senol, S., Leblebicioglu, K., & Schmidt, E. G. (2011). INtERCEDE: An algorithmic approach to networked control system design. Journal of Network and Computer Applications, 34(4), 1326–1341.CrossRef Senol, S., Leblebicioglu, K., & Schmidt, E. G. (2011). INtERCEDE: An algorithmic approach to networked control system design. Journal of Network and Computer Applications, 34(4), 1326–1341.CrossRef
25.
Zurück zum Zitat Li, X., & Sun, J. Q. (2018). Signal multiobjective optimization for urban traffic network. IEEE Transactions on Intelligent Transportation Systems, 19(11), 3529–3537.CrossRef Li, X., & Sun, J. Q. (2018). Signal multiobjective optimization for urban traffic network. IEEE Transactions on Intelligent Transportation Systems, 19(11), 3529–3537.CrossRef
26.
Zurück zum Zitat Li, X., & Sun, J. Q. (2019). Turning-lane and signal optimization at intersections with multiple objectives. Engineering Optimization, 51(3), 484–502.CrossRef Li, X., & Sun, J. Q. (2019). Turning-lane and signal optimization at intersections with multiple objectives. Engineering Optimization, 51(3), 484–502.CrossRef
27.
Zurück zum Zitat Li, X., & Sun, J. Q. (2019). Intersection multi-objective optimization on signal setting and lane assignment. Physica A: Statistical Mechanics and its Applications, 525, 1233–1246.CrossRef Li, X., & Sun, J. Q. (2019). Intersection multi-objective optimization on signal setting and lane assignment. Physica A: Statistical Mechanics and its Applications, 525, 1233–1246.CrossRef
31.
Zurück zum Zitat Jha, S. B., Jha, J. K., & Tiwari, M. K. (2019). A multi-objective meta-heuristic approach for transit network design and frequency setting problem in a bus transit system. Computers & Industrial Engineering, 130, 166–186.CrossRef Jha, S. B., Jha, J. K., & Tiwari, M. K. (2019). A multi-objective meta-heuristic approach for transit network design and frequency setting problem in a bus transit system. Computers & Industrial Engineering, 130, 166–186.CrossRef
32.
Zurück zum Zitat Avin, C., Mondal, K., & Schmid, S., (2019). Demand-aware network design with minimal congestion and route lengths. In IEEE INFOCOM 2019-IEEE conference on computer communications (pp. 1351–1359). IEEE. Avin, C., Mondal, K., & Schmid, S., (2019). Demand-aware network design with minimal congestion and route lengths. In IEEE INFOCOM 2019-IEEE conference on computer communications (pp. 1351–1359). IEEE.
33.
Zurück zum Zitat Mamaghani, E. J., & Davari, S. (2020). The bi-objective periodic closed loop network design problem. Expert Systems with Applications, 144, 113068.CrossRef Mamaghani, E. J., & Davari, S. (2020). The bi-objective periodic closed loop network design problem. Expert Systems with Applications, 144, 113068.CrossRef
34.
Zurück zum Zitat Huang, D., Gu, Y., Wang, S., Liu, Z., & Zhang, W. (2020). A two-phase optimization model for the demand-responsive customized bus network design. Transportation Research Part C: Emerging Technologies, 111, 1–21.CrossRef Huang, D., Gu, Y., Wang, S., Liu, Z., & Zhang, W. (2020). A two-phase optimization model for the demand-responsive customized bus network design. Transportation Research Part C: Emerging Technologies, 111, 1–21.CrossRef
35.
Zurück zum Zitat Liu, Y., Feng, X., Zhang, L., Hua, W., & Li, K. (2020). A Pareto artificial fish swarm algorithm for solving a multi-objective electric transit network design problem. Transportmetrica A: Transport Science. Liu, Y., Feng, X., Zhang, L., Hua, W., & Li, K. (2020). A Pareto artificial fish swarm algorithm for solving a multi-objective electric transit network design problem. Transportmetrica A: Transport Science.
36.
Zurück zum Zitat Nematian, J. (2020). Reliable hub-and-spoke network design problems under uncertainty through multi-objective programming. Iranian Journal of Fuzzy Systems, 17(4), 179–198. Nematian, J. (2020). Reliable hub-and-spoke network design problems under uncertainty through multi-objective programming. Iranian Journal of Fuzzy Systems, 17(4), 179–198.
38.
Zurück zum Zitat Williams, H. P. (2013). Model building in mathematical programming. New York: Wiley. Williams, H. P. (2013). Model building in mathematical programming. New York: Wiley.
39.
Zurück zum Zitat Mattel, J. M. (1999). Multicriterion decision aid: methods and applications. In CORS-SCRO annual conference. Mattel, J. M. (1999). Multicriterion decision aid: methods and applications. In CORS-SCRO annual conference.
40.
Zurück zum Zitat Zaidi, S. J. (1982). Linear programming in single and multiple objective systems. Journal of the Operational Research Society, 33(6), 591–591.CrossRef Zaidi, S. J. (1982). Linear programming in single and multiple objective systems. Journal of the Operational Research Society, 33(6), 591–591.CrossRef
41.
Zurück zum Zitat Miettinen, K. M. (1999). Nonlinear multiobjective optimization. Boston: Kluwer. Miettinen, K. M. (1999). Nonlinear multiobjective optimization. Boston: Kluwer.
42.
Zurück zum Zitat Zeleny, M. (Ed.). (2012). Multiple criteria decision making Kyoto 1975 (Vol. 123). Berlin: Springer. Zeleny, M. (Ed.). (2012). Multiple criteria decision making Kyoto 1975 (Vol. 123). Berlin: Springer.
43.
Zurück zum Zitat Tabatabaei, M. H., & Bazrkar, A. (2019). Providing a model for ranking suppliers in the sustainable supply chain using cross efficiency method in data envelopment analysis. Brazilian Journal of Operations & Production Management, 16(1), 43–52.CrossRef Tabatabaei, M. H., & Bazrkar, A. (2019). Providing a model for ranking suppliers in the sustainable supply chain using cross efficiency method in data envelopment analysis. Brazilian Journal of Operations & Production Management, 16(1), 43–52.CrossRef
Metadaten
Titel
A Pareto frontier for node survivable computer network design problem
verfasst von
Ali Hadian
Mehri Bagherian
Publikationsdatum
06.10.2020
Verlag
Springer US
Erschienen in
Telecommunication Systems / Ausgabe 3/2021
Print ISSN: 1018-4864
Elektronische ISSN: 1572-9451
DOI
https://doi.org/10.1007/s11235-020-00713-6

Weitere Artikel der Ausgabe 3/2021

Telecommunication Systems 3/2021 Zur Ausgabe

Neuer Inhalt