A note on capacity provisioning in SDN service provider network

Mariusz Gola, Adam Czubak

Abstract


In this paper we take a closer look at ISP networks that have a centralized SDN control plane. A heuristic algorithm for the CFA problem for such networks is proposed, that takes under account two factors: the speed of individual links and ISP network's given properties.

Keywords


WAN; routing; CFA; SDN

Full Text:

PDF

References


Agarwal S., Kodialam M., Lakshman T. V.: Traffic engineering in software defined networks. In INFOCOM Proceedings IEEE, 2013, p. 2211÷2219.

Cormen T. H., Leiserson C. E., Rivest R. L., Stein C.: Introduction to algorithms. MIT press 2001.

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), 2013, p. 217÷234.

Fratta L., Gerla M., Kleinrock L.: Flow Deviation: 40 years of incremental flows for packets, waves, cars and tunnels. Computer Networks, 66, 2014, p. 18÷31.

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, 2013, p. 13÷25.

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, 2010, p. 1041÷1048.

Gola M., Kasprzak A: The two-criteria topological design problem in WAN with delay constraint, Computational Science and Its Applications – ICCSA 2003.

Gola M., Czubak A.: Approximate Algorithm for Fast Capacity Provisioning in WANs with Trade-Off between Performance and Cost under Budget Constraint. In Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX. June 30÷July 4, 2014, Springer International Publishing, Brunów, Poland, 2014, p. 211÷221.

Goscien R., Pozniak-Koszalka I., Koszalka L., Kasprzak A.: A Top-Down Heuristic for TCFA Problem in WAN. In ICWMC 2013, The Ninth International Conference on Wireless and Mobile Communications, 2013, p. 89÷94.

Gude N., Koponen T., Pettit J., Pfaff B., Casado M., McKeown N., Shenker S.: Nox: towards an operating system for networks. SIGCOMM Comput. Commun. Rev. 38, July 2008, p. 105÷110.

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.

Koponen T., Casado M., Gude N., Stribling J., Poutievski L., Zhu M., Ramanathan R., Iwata Y., Inoue H., Hama T., Shenker S.: Onix: a distributed control platform for large-scale production networks. In: Proceedings of the 9th USENIX conference on Operating systems design and implementation. OSDI’10, USENIX Association, Berkeley, CA, USA 2010, p. 1÷6.

Lin G., Huang C., Zhan S., Lu X., Lu Y.: Ranking Based Selection Genetic Algorithm for Capacity Flow Assignments. In Computational Intelligence and Intelligent Systems, Springer, Berlin Heidelberg 2010, p. 97÷107.

Pioro M., Medhi D.: Routing, flow, and capacity design in communication and computer networks. Morgan Kaufmann, 2004.

Walkowiak K.: A flow deviation algorithm for joint optimization of unicast and anycast flows in connection-oriented networks. In: Computational Science and its Applications–ICCSA 2008, Springer, 2008, p. 797÷807.

Van der Merwe J., Kalmanek C.: Network Programmability is the answer. In Workshop on Programmable Routers for the Extensible Services of Tomorrow (PRESTO 2007), Princeton, NJ, May 2007.

Zhan Y., Lu J., Li S.: A Hybrid GA-TS Algorithm for Optimizing Networked Manufacturing Resources Configuration. Appl. Math, 7(5), 2013, p. 2045÷2053.




DOI: http://dx.doi.org/10.21936/si2015_v36.n4.740