Skip to main content
Top

2013 | OriginalPaper | Chapter

Genetic Algorithm for Solving Survivable Network Design with Simultaneous Unicast and Anycast Flows

Authors : Huynh Thi Thanh Binh, Son Hong Ngo, Dat Ngoc Nguyen

Published in: Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013

Publisher: Springer Berlin Heidelberg

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We consider the survivable network design problem for simultaneous unicast and anycast flow requests. In this problem, a network is modeled by a connected, weighted and undirected graph with link cost follows All Capacities Modular Cost (ACMC) model. Given a set of flow demand, this problem aims at finding a set of connection with minimized network cost to protect the network against any single failure. This problem is proved to be NP-hard. In this paper, we propose a new Genetic Algorithm for solving the ACMC Survivable Network Design Problem (A-SNDP). Extensive simulation results on Polska, Germany and Atlanta network instances show that the proposed algorithm is much more efficient than the Tabu Search and other baseline algorithms such as FBB1 and FBB2 in terms of minimizing the network cost.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
1.
go back to reference Gładysz J et al (2010) Tabu search algorithm for survivable network design problem with simultaneous unicast and anycast flows. Int J Electron Telecommun 56(1):41-48, Versita Publisher, Warsaw Gładysz J et al (2010) Tabu search algorithm for survivable network design problem with simultaneous unicast and anycast flows. Int J Electron Telecommun 56(1):41-48, Versita Publisher, Warsaw
2.
go back to reference Walkowiak K (2008) Optimization of unicast and anycast flows in connection-oriented networks. In: Gervas O (ed) Proceedings of computational science and its applications—ICCSA 2008, LNCS, vol 5072. Springer, Perugia, pp 797–807 Walkowiak K (2008) Optimization of unicast and anycast flows in connection-oriented networks. In: Gervas O (ed) Proceedings of computational science and its applications—ICCSA 2008, LNCS, vol 5072. Springer, Perugia, pp 797–807
4.
go back to reference Walkowiak K (2006) A new function for optimization of working paths in survivable MPLS networks. In: Proceedings of computer and information sciences—ISCIS 2006. Springer, Istanbul, pp 424–433 Walkowiak K (2006) A new function for optimization of working paths in survivable MPLS networks. In: Proceedings of computer and information sciences—ISCIS 2006. Springer, Istanbul, pp 424–433
5.
go back to reference Grover W (2004) Mesh-based survivable networks: options and strategies for optical, MPLS SONET and ATM networking. Prentice Hall PTR, New Jersey Grover W (2004) Mesh-based survivable networks: options and strategies for optical, MPLS SONET and ATM networking. Prentice Hall PTR, New Jersey
6.
go back to reference Sharma V, Hellstrand F (2003) Framework for MPLS-based recovery. RFC 3469 Sharma V, Hellstrand F (2003) Framework for MPLS-based recovery. RFC 3469
7.
go back to reference Gladysz J, Walkowiak K (2009) Optimization of survivable networks with simultaneous unicast and anycast flows. In: Proceedings of ICUMT. Poland, pp 1–6 Gladysz J, Walkowiak K (2009) Optimization of survivable networks with simultaneous unicast and anycast flows. In: Proceedings of ICUMT. Poland, pp 1–6
8.
go back to reference Binh H et al (2012) Heuristic algorithms for solving survivable network design problem with simultaneous unicast and anycast flows. In: Proceedings of 8th international conference on intelligence on computing, ICIC 2012. Huangshang, China, pp 137–145 Binh H et al (2012) Heuristic algorithms for solving survivable network design problem with simultaneous unicast and anycast flows. In: Proceedings of 8th international conference on intelligence on computing, ICIC 2012. Huangshang, China, pp 137–145
9.
go back to reference Nissen V, Gold S (2008) Survivable network design with an evolution strategy. In: Proceedings of success in evolutionary computation. Springer, Berlin, pp 263–283 Nissen V, Gold S (2008) Survivable network design with an evolution strategy. In: Proceedings of success in evolutionary computation. Springer, Berlin, pp 263–283
10.
go back to reference Pioro M, Medhi D (2004) Routing, flow, and capacity design in communication and computer networks. Morgan Kaufmann Publishers, San Francisco Pioro M, Medhi D (2004) Routing, flow, and capacity design in communication and computer networks. Morgan Kaufmann Publishers, San Francisco
11.
go back to reference Battiti R, Brunato M, Mascia F (2008) Reactive search intelligent optimization. Springer, New York Battiti R, Brunato M, Mascia F (2008) Reactive search intelligent optimization. Springer, New York
12.
go back to reference Vasseur J, Pickavet M, Demeester P (2004) Network recovery: protection and restoration of optical, SONET-SDH IP and MPLS. Morgan Kaufmann, San Francisco Vasseur J, Pickavet M, Demeester P (2004) Network recovery: protection and restoration of optical, SONET-SDH IP and MPLS. Morgan Kaufmann, San Francisco
13.
go back to reference Kasprzak A (1989) Algorithms of flow, capacity and topology structure in computer networks. Monography, Wroclaw Kasprzak A (1989) Algorithms of flow, capacity and topology structure in computer networks. Monography, Wroclaw
14.
go back to reference Walkowiak K (2003) Anycast communication—a new approach to survivability of connection-oriented networks. In: Proceedings of communications in computer and information science. Springer, Berlin, pp 378–389 Walkowiak K (2003) Anycast communication—a new approach to survivability of connection-oriented networks. In: Proceedings of communications in computer and information science. Springer, Berlin, pp 378–389
15.
go back to reference Johnson D, Deering S (1999) Reserved IPv6 subnet anycast addresses. RFC 2526 Johnson D, Deering S (1999) Reserved IPv6 subnet anycast addresses. RFC 2526
16.
go back to reference Michalewicz Z (1995) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer Michalewicz Z (1995) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer
Metadata
Title
Genetic Algorithm for Solving Survivable Network Design with Simultaneous Unicast and Anycast Flows
Authors
Huynh Thi Thanh Binh
Son Hong Ngo
Dat Ngoc Nguyen
Copyright Year
2013
Publisher
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-37502-6_144

Premium Partner