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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River (2004)
Sharma, V., Hellstrand, F.: Framework for MPLS-based Recovery. RFC 3469 (2003)
Vasseur, J., Pickavet, M., Demeester, P.: Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP and MPLS. Morgan Kaufmann, San Francisco (2004)
Kasprzak, A.: Algorithms of Flow, Capacity and Topology Structure in Computer Networks, Monography, Wroclaw, Polish (1989)
Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers (2004)
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)
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)
Johnson, Deering: Reserved IPv6 Subnet Anycast Addresses. RFC 2526 (1999)
Anycast vs Unicast, http://communitydns.eu/Anycast.pdf
Gladysz, J., Walkowiak, K.: Optimization of Survivable Networks with Simultaneous Unicast and Anycast Flows. In: ICUMT, Poland, pp. 1–6 (2009)
Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization. Springer, New York (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Binh, H.T.T., Long, P.V., Dat, N.N., Ha, N.S.T. (2012). Heuristic Algorithms for Solving Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows. In: Huang, DS., Jiang, C., Bevilacqua, V., Figueroa, J.C. (eds) Intelligent Computing Technology. ICIC 2012. Lecture Notes in Computer Science, vol 7389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31588-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-31588-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31587-9
Online ISBN: 978-3-642-31588-6
eBook Packages: Computer ScienceComputer Science (R0)