Abstract
Due to the emergence of Software Defined Networking (SDN) with the idea of centralized control over computer networks, the Capacity and Flow Assignment Problem (CFA) may be approached in a classical non-distributed fashion in real-life scenarios. The question arises whether a heuristical approach to this NP-complete problem is of any use in practice.
This paper is focused on the problem of configuring a Wide Area Network topology with trade-off between link cost and response time to users under budget constraint. The link capacities in the network and the routes used by packets are determined in a way to minimize network link cost and response time at the same time. Budget constraint means, that network link cost should be lower than the given budget value. An exact algorithm for CFA, due to its NP-completeness, is either not feasible or works well for small networks only. In this paper we propose an alternative heuristic solution, compare its effectiveness to the exact solution and finally show its running time when used for a real-life computer network. The experiments performed using standard off-the-shelf computer gear show that this solution is fast enough and surprisingly accurate and thus ready for implementation for an SDN controller.
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
Agarwal, S., Kodialam, M., Lakshman, T.V.: Traffic engineering in software defined networks. In: Proceedings of the IEEE INFOCOM, pp. 2211–2219. IEEE (2013)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press (2001)
Gola, M., Czubak, A.: Designing Frame Relay WAN Networks with Trade-off Between Link Cost and Performance. In: Gruca, A., Czachórski, T., Kozielski, S. (eds.) Man-Machine Interactions 3. AISC, vol. 242, pp. 559–566. Springer, Heidelberg (2014)
Ferreira, R.P.M., Luna, H.P.L., Mahey, P., Souza, M.C.D.: Global optimization of capacity expansion and flow assignment in multicommodity networks. Pesquisa Operacional 33(2), 217–234 (2013)
Fratta, L., Gerla, M., Kleinrock, L.: The flow deviation method: An approach to storeand-forward communication network design. Networks 3(2), 97–133 (1973)
Gavish, B., Neuman, I.: A system for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications 37(4), 360–366 (1989)
Girgis, M., Mahmoud, T., El-Hameed, H.A., El-Saghier, Z.: Routing and capacity assignment problem in computer networks using genetic algorithm. Inf. Sci. Lett 2, 13–25 (2013)
Gladysz, J., Walkowiak, K.: Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions–exact and heuristic algorithms. Electronic Notes in Discrete Mathematics, pp. 1041–1048 (2010)
Gola, M.: An algorithms for capacity and flow assignment in wide area computer network with combined cost criterion. Ph.D. thesis, Wroclaw University of Technology (2000)
Goscien, R., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A.: A Top-Down Heuristic for TCFA Problem in WAN. In: The Ninth International Conference on Wireless and Mobile Communications, ICWMC 2013, pp. 89–94 (2013)
Koldehofe, B., Dürr, F., Tariq, M.A., Rothermel, K.: The power of software-defined networking: line-rate content-based routing using OpenFlow. In: Proceedings of the 7th Workshop on Middleware for Next Generation Internet Computing, p. 3. ACM (2013)
Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)
Kim, H., Feamster, N.: Improving network management with software defined networking. IEEE Communications Magazine 51(2), 114–119 (2013)
Lin, G., Huang, C., Zhan, S., Lu, X., Lu, Y.: Ranking Based Selection Genetic Algorithm for Capacity Flow Assignments. In: Cai, Z., Tong, H., Kang, Z., Liu, Y. (eds.) ISICA 2010. CCIS, vol. 107, pp. 97–107. Springer, Heidelberg (2010)
Pioro, M., Medhi, D.: Routing, flow, and capacity design in communication and computer networks. Morgan Kaufmann (2004)
Shen, J., Xu, F., Zheng, P.: A tabu search algorithm for the routing and capacity assignment problem in computer networks. Computers & Operations Research 32(11), 2785–2800 (2005)
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)
Zhan, Y., Lu, J., Li, S.: A Hybrid GA-TS Algorithm for Optimizing Networked Manufacturing Resources Configuration. Appl. Math 7(5), 2045–2053 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gola, M., Czubak, A. (2014). Approximate Algorithm for Fast Capacity Provisioning in WANs with Trade-Off between Performance and Cost under Budget Constraint. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. June 30 – July 4, 2014, Brunów, Poland. Advances in Intelligent Systems and Computing, vol 286. Springer, Cham. https://doi.org/10.1007/978-3-319-07013-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-07013-1_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07012-4
Online ISBN: 978-3-319-07013-1
eBook Packages: EngineeringEngineering (R0)