Advertisement

Heuristic Algorithms for Solving Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows

  • Huynh Thi Thanh Binh
  • Pham Vu Long
  • Nguyen Ngoc Dat
  • Nguyen Sy Thai Ha
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7389)

Abstract

Given a connected, weighted, undirected graph G = (V, E), a set of nodes, a set of links with modular cost based on ACMC model [2] and a set of customers’ demands. This paper proposes two heuristic algorithms for solving the ACMC Survivable Network Design Problem (A-SNDP). The goal is to design connections based on customers’ demands with the smallest network cost to protect the network against all failures. This problem is NP-hard. The experimental results are reported to show the efficiency of proposed algorithm comparing to the Tabu Search algorithm [2].

Keywords

survivable network design anycast unicast A-SNDP 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Walkowiak, K.: A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part II. LNCS, vol. 5073, pp. 797–807. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Gładysz, J., Walkowiak, K.: Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows. Intl Journal of Electronics and Telecommunications 56(1), 41–48 (2010)CrossRefGoogle Scholar
  3. 3.
    Walkowiak, K.: A New Function for Optimization of Working Paths in Survivable MPLS Networks. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds.) ISCIS 2006. LNCS, vol. 4263, pp. 424–433. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River (2004)Google Scholar
  5. 5.
    Sharma, V., Hellstrand, F.: Framework for MPLS-based Recovery. RFC 3469 (2003)Google Scholar
  6. 6.
    Vasseur, J., Pickavet, M., Demeester, P.: Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP and MPLS. Morgan Kaufmann, San Francisco (2004)Google Scholar
  7. 7.
    Kasprzak, A.: Algorithms of Flow, Capacity and Topology Structure in Computer Networks, Monography, Wroclaw, Polish (1989)Google Scholar
  8. 8.
    Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers (2004)Google Scholar
  9. 9.
    Walkowiak, K.: Anycast Communication – A New Approach to Survivability of Connection-Oriented Networks. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds.) MMM-ACNS 2007. CCIS, vol. 1, pp. 378–389. Springer, Heidelberg (2007)Google Scholar
  10. 10.
    Nissen, V., Gold, S.: Survivable Network Design with An Evolution Strategy. In: Yang, A., Shan, Y., Bui, L.T. (eds.) Success in Evolutionary Computation. SCI, vol. 92, pp. 263–283. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  11. 11.
    Johnson, Deering: Reserved IPv6 Subnet Anycast Addresses. RFC 2526 (1999)Google Scholar
  12. 12.
  13. 13.
    Gladysz, J., Walkowiak, K.: Optimization of Survivable Networks with Simultaneous Unicast and Anycast Flows. In: ICUMT, Poland, pp. 1–6 (2009)Google Scholar
  14. 14.
    Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization. Springer, New York (2008)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Huynh Thi Thanh Binh
    • 1
  • Pham Vu Long
    • 1
  • Nguyen Ngoc Dat
    • 1
  • Nguyen Sy Thai Ha
    • 1
  1. 1.School of Information and Communication TechnologyHanoi University of Science and TechnologyHanoiVietnam

Personalised recommendations