Abstract
We study the survivable network design problem (SNDP) for simultaneous unicast and anycast flows in networks where the link cost follows All Capacities Modular Cost (ACMC) model. Given a network modeled by a connected, undirected graph and a set of flow demands, this problem aims at finding a set of connections with a minimized network cost in order to protect the network against any single failure. In this paper, we propose a new Genetic Algorithm with an efficient encoding to solve the SNDP in networks with ACMC model (A-SNDP). Our encoding scheme is simple and allows large search space. Extensive simulation results on real topology instances show that the proposed algorithm is much more efficient than the Tabu Search and other conventional Genetic Algorithm in terms of minimizing the network cost.
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
Johnson, Deering: Reserved IPv6 Subnet Anycast Addresses. RFC 2526 (1999)
Ballani, H., Francis, P.: Towards a global IP anycast service. In: SIGCOMM 2005, New York, USA, pp. 301–312 (2005)
Walkowiak, K.: Anycast Communication – A New Approach to Survivability of Connec-tion-Oriented Networks. Comm. in Computer and Info. Science, 378–389 (2003)
Gładysz, J., Walkowiak, K.: Tabu Search Algorithm for Survivable Network Design Prob-lem with Simultaneous Unicast and Anycast Flows. Intl. Journal of Electronics & Telecom 56(1), 41–48 (2010)
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)
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, New Jersey (2004)
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. 91, pp. 263–283. Springer, Heidelberg (2008)
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)
Gladysz, J.: Krzysztof Walkowiak: Optimization of survivable networks with simul-taneous unicast and anycast flows. In: ICUMT, Poland, pp. 1–6 (2009)
Binh, H.T.T., et al.: Genetic Algorithm for Solving Survivable Network Design with Simultaneous Unicast and Anycast Flows. In: Yin, Z., Pan, L., Fang, X. (eds.) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. AISC, vol. 212, pp. 1237–1247. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Binh, H.T.T., Ngo, S.H. (2014). Survivable Flows Routing in Large Scale Network Design Using Genetic Algorithm. In: Jeong, H., S. Obaidat, M., Yen, N., Park, J. (eds) Advances in Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41674-3_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-41674-3_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41673-6
Online ISBN: 978-3-642-41674-3
eBook Packages: EngineeringEngineering (R0)