Abstract
Software Defined Networking (or SDN) allows to apply a centralized control over a network of commuters in order to provide better global performances. One of the problem to solve is the multicommodity flow routing where a set of demands have to be routed at minimum cost. In contrast with other versions of this problem, we consider here problems with congestion that change the cost of a link according to the capacity used. We propose here to study centralized routing with Constraint Programming and Column Generation approaches. Furthermore, selfish routing is studied through with Constraint Games. Selfish routing is important for the perceived quality of the solution since no user is able to improve his cost by changing only his own path. We present real and synthetic benchmarks that show a good scalability.
Similar content being viewed by others
References
Awerbuch, B., Azar, Y., Epstein, A. (2013). The price of routing unsplittable flow. SIAM Journal of Computing, 42(1), 160–177. https://doi.org/10.1137/070702370.
Azzouni, A., Boutaba, R., Pujolle, G. (2017). Neuroute: predictive dynamic routing for software-defined networks. In 13th International conference on network and service management, CNSM 2017, Tokyo, Japan, November 26-30, 2017 (pp. 1–6): IEEE Computer Society, DOI https://doi.org/10.23919/CNSM.2017.8256059.
Barnhart, C., Hane, C.A., Vance, P.H. (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research, 48(2), 318–326. https://doi.org/10.1287/opre.48.2.318.12378.
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316–329. https://doi.org/10.1287/opre.46.3.316.
Bisschop, J. (2006). AIMMS optimization modeling. Lulu com.
Braess, D., Nagurney, A., Wakolbinger, T. (2005). On a paradox of traffic planning. Transportation Science, 39(4), 446–450. https://doi.org/10.1287/trsc.1050.0127.
Capone, A., Cascone, C., Nguyen, A.Q.T., Sansȯ, B. (2015). Detour planning for fast and reliable failure recovery in SDN with openstate. In 11th International conference on the design of reliable communication networks, DRCN 2015, Kansas City, MO, USA, March 24-27, 2015 (pp. 25–32): IEEE, DOI https://doi.org/10.1109/DRCN.2015.7148981.
Capone, A., Cascone, C., Nguyen, A.Q., Sanso, B. (2015). Detour planning for fast and reliable failure recovery in sdn with openstate. In 2015 11th international conference on the design of reliable communication networks (DRCN) (pp. 25–32): IEEE.
Chabert, G, & et al. (2009). Ibex An iInterval based EXplorer. http://www.ibex-lib.org.
Chabert, G., & Jaulin, L. (2009). Contractor programming. Artificial Intelligence, 173(11), 1079–1100.
Chabrier, A., Danna, E., Pape, C.L., Perron, L. (2004). Solving a network design problem. Annals OR, 130(1–4), 217–239. https://doi.org/10.1023/B:ANOR.0000032577.81139.84.
Correa, J.R., Schulz, A.S., Moses, N.E.S. (2004). Selfish routing in capacitated networks. Mathematics of Operations Research, 29(4), 961–976. https://doi.org/10.1287/moor.1040.0098.
Correa, J.R., Schulz, A.S., Moses, N.E.S. (2007). Fast, fair, and efficient flows in networks. Operations Research, 55(2), 215–225. https://doi.org/10.1287/opre.1070.0383.
CPLEX, I.I. (2014). 12.6 CPLEX User’s Manual.
Even, S., Itai, A., Shamir, A. (1975). On the complexity of time table and multi-commodity flow problems. In Proceedings of the 16th annual symposium on foundations of computer science, SFCS ’75 (pp. 184–193). Washington, DC: IEEE Computer Society, DOI https://doi.org/10.1109/SFCS.1975.21.
Fudenberg, D., & Tirole, J. (1991). Game theory. The MIT Press.
Garey, M.R., & Johnson, D.S. (1979). Computers and intractability: a guide to the theory of NP-completeness. W. H Freeman.
Gottlob, G., Greco, G., Scarcello, F. (2005). Pure Nash equilibria: hard and easy games. Journal of Artificial Intelligence Research (JAIR), 24, 357–406.
Harks, T., Heinz, S., Pfetsch, M.E. (2006). Competitive online multicommodity routing. In Erlebach, T., & Kaklamanis, C. (Eds.) Approximation and online algorithms, 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised papers. Lecture notes in computer science, (Vol. 4368 pp. 240–252): Springer, DOI https://doi.org/10.1007/11970125_19.
Hayrapetyan, A., Tardos, É., Wexler, T. (2007). A network pricing game for selfish traffic. Distributed Computing, 19(4), 255–266. https://doi.org/10.1007/s00446-006-0020-y.
Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M. (2006). Constraint models for the covering test problem. Constraints, 11(2-3), 199–219. https://doi.org/10.1007/s10601-006-7094-9.
Huin, N., Jaumard, B., Giroire, F. (2018). Optimal network service chain provisioning. IEEE/ACM Transactions on Networking, 26(3), 1320–1333. http://doi.ieeecomputersociety.org/10.1109/TNET.2018.2833815.
Huin, N., Tomassilli, A., Giroire, F., Jaumard, B. (2018). Energy-efficient service function chain provisioning. Electronic Notes in Discrete Mathematics, 64, 265–274. https://doi.org/10.1016/j.endm.2018.02.001.
IDC Forecast. (2019). The growth in connected IoT devices is expected to generate 79.4ZB of data in 2025. IDC Press release.
Key, P.B., & McAuley, D. (1999). Differential qos and pricing in networks: where flow control meets game theory. IEE Proceedings - Software, 146(1), 39–43. https://doi.org/10.1049/ip-sen:19990154.
Layeghy, S., Pakzad, F., Portmann, M. (2016). SCOR: constraint programming-based northbound interface for SDN. In 26th International telecommunication networks and applications conference, ITNAC 2016, Dunedin, New Zealand, December 7-9, 2016. http://doi.ieeecomputersociety.org/10.1109/ATNAC.2016.7878788 (pp. 83–88): IEEE.
Leguay, J., Draief, M., Chouvardas, S., Paris, S., Paschos, G.S., Maggi, L., Qi, M. (2016). Online and global network optimization: towards the next-generation of routing platforms. arXiv:1602.01629.
Lisser, A., & Mahey, P. (2006). Multicommodity flow problems and decomposition in telecommunications networks. In Resende, M.G.C., & Pardalos, P.M. (Eds.) Handbook of optimization in telecommunications (pp. 241–267): Springer, DOI https://doi.org/10.1007/978-0-387-30165-5_10.
Liu, T., Callegati, F., Cerroni, W., Contoli, C., Gabbrielli, M., Giallorenzo, S. (2018). Constraint programming for flexible service function chaining deployment. arXiv:1812.05534.
Mendiola, A., Astorga, J., Jacob, E., Higuero, M. (2017). A survey on the contributions of software-defined networking to traffic engineering. IEEE Communications Surveys and Tutorials, 19(2), 918–953. https://doi.org/10.1109/COMST.2016.2633579.
Nash, J. (1951). Non-cooperative Games. Annals of Mathematics, 54(2), 286–295.
Nguyen, T., & Lallouet, A. (2014). A complete solver for constraint games. In O’Sullivan, B. (Ed.) CP 2014, Lyon, France, September 8-12, 2014. LNCS, (Vol. 8656 pp. 58–74): Springer, DOI https://doi.org/10.1007/978-3-319-10428-7_8.
Nie, C., & Leung, H. (2011). A survey of combinatorial testing. ACM Computing Surveys, 43(2), 11:1–11:29. http://doi.acm.org/10.1145/1883612.1883618.
Orda, A., Rom, R., Shimkin, N. (1993). Competitive routing in multi-user communication networks. In Proceedings IEEE INFOCOM ’93, the conference on computer communications, twelfth annual joint conference of the IEEE computer and communications societies, networking: foundation for the future, San Francisco, CA, USA, March 28 - April 1, 1993 (pp. 964–971): IEEE, DOI https://doi.org/10.1109/INFCOM.1993.253270.
Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R. (2009). SNDlib 1.0 – survivable network design library. In Proceedings of the 3rd international network optimization conference (INOC 2007), Spa, Belgium (April 2007). http://www.zib.de/orlowski/Paper/OrlowskiPioroTomaszewskiWessaely2007-SNDlib-INOC.pdf.gz, http://sndlib.zib.de, extended version accepted in Networks.
Palmieri, A., & Lallouet, A. (2017). Constraint games revisited. In Sierra, C. (Ed.) Proceedings of the twenty-sixth international joint conference on artificial intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017. ijcai.org (pp. 729–735), DOI https://doi.org/10.24963/ijcai.2017/101.
Pape, C.L., Perron, L., Régin, J., Shaw, P. (2002). Robust and parallel solving of a network design problem. In Hentenryck, P.V. (Ed.) Principles and practice of constraint programming - CP 2002, 8th international conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings. LNCS, (Vol. 2470 pp. 633–648): Springer, DOI https://doi.org/10.1007/3-540-46135-3_42.
Paris, S., Destounis, A., Maggi, L., Paschos, G.S., Leguay, J. (2016). Controlling flow reconfigurations in SDN. In 35th Annual IEEE international conference on computer communications, INFOCOM 2016, San Francisco, CA, USA, April 10-14, 2016 (pp. 1–9): IEEE, DOI https://doi.org/10.1109/INFOCOM.2016.7524330.
Pham, Q., & Deville, Y. (2012). Solving the longest simple path problem with constraint-based techniques. In Beldiceanu, N., Jussien, N., Pinson, E. (Eds.) Integration of constraint programming, artificial intelligence and operations research, CPAIOR 2012, Nantes, France, May 28 - June1, 2012. LNCS, (Vol. 7298 pp. 292–306): Springer, DOI https://doi.org/10.1007/978-3-642-29828-8_19.
Prud’homme, C., Fages, J.G., Lorca, X. (2017). Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. http://www.choco-solver.org.
Puri, A., & Tripakis, S. (2002). Algorithms for the multi-constrained routing problem. In Penttonen, M., & Schmidt, E.M. (Eds.) Algorithm theory - SWAT 2002, 8th Scandinavian workshop on algorithm theory, Turku, Finland, July 3-5, 2002 Proceedings. Lecture notes in computer science, (Vol. 2368 pp. 338–347): Springer, DOI https://doi.org/10.1007/3-540-45471-3_35.
Qin, Q., Poularakis, K., Iosifidis, G., Tassiulas, L. (2018). SDN controller placement at the edge: optimizing delay and overheads. In 2018 IEEE Conference on computer communications, INFOCOM 2018, Honolulu, HI, USA, April 16-19, 2018 (pp. 684–692): IEEE, DOI https://doi.org/10.1109/INFOCOM.2018.8485963.
Quang, P.T.A., Sanner, J.M., Morin, C., Hadjadj-Aoul, Y. (2018). Multi-objective multi-constrained qos routing in large-scale networks: a genetic algorithm approach. In 2018 International conference on smart communications in network technologies (SaCoNeT) (pp. 55–60): IEEE.
Refalo, P. (2004). Impact-based search strategies for constraint programming. In Wallace, M. (Ed.) Principles and practice of constraint programming - CP 2004, 10th international conference, CP 2004, Toronto, Canada, September 27 - October 1, 2004, Proceedings. Lecture notes in computer science, (Vol. 3258 pp. 557–571): Springer, DOI https://doi.org/10.1007/978-3-540-30201-8_41.
Rosen, J.B. (1965). Existence and uniqueness of equilibrium points for concave n-person games. Econometrica, 33(3), 520–534.
Roughgarden, T. (2007). Routing games, chap. 18, Algorithmic game theory (pp. 461–486). Cambridge University Press.
Sanner, J.M., Hadjadj-Aoul, Y., Ouzzif, M., Rubino, G. (2017). An evolutionary controllers’ placement algorithm for reliable sdn networks. In 2017 13th international conference on network and service management (CNSM) (pp. 1–6): IEEE.
Sellmann, M., Gellermann, T., Wright, R. (2007). Cost-based filtering for shorter path constraints. Constraints, 12(2), 207–238. https://doi.org/10.1007/s10601-006-9006-4.
Shoham, Y., & Leyton-Brown, K. (2009). Multiagent systems - algorithmic, game-theoretic, and logical foundations. Cambridge University Press.
Song, S., Lee, J., Son, K., Jung, H., Lee, J. (2016). A congestion avoidance algorithm in SDN environment. In 2016 International conference on information networking, ICOIN 2016, Kota Kinabalu, Malaysia, January 13-15, 2016 (pp. 420–423): IEEE Computer Society, DOI https://doi.org/10.1109/ICOIN.2016.7427148.
Szymanski, T.H. (2013). Max-flow min-cost routing in a future-internet with improved qos guarantees. IEEE Transactions on Communications, 61(4), 1485–1497. https://doi.org/10.1109/TCOMM.2013.020713.110882.
Tajiki, M., Akbari, B., Shojafar, M., Mokari, N. (2017). Joint qos and congestion control based on traffic prediction in sdn. Applied Sciences, 7(12), 1265.
Vassilaras, S., Gkatzikis, L., Liakopoulos, N., Stiakogiannakis, I., Qi, M., Shi, L., Liu, L., Debbah, M., Paschos, G. (2017). The algorithmic aspects of network slicing. IEEE Communications Magazine.
Von Neumann, J., & Morgenstern, O. (1944). Theory of games and economic behavior. Princeton University Press. http://jmvidal.cse.sc.edu/library/neumann44a.pdf.
Yu, L., Lei, Y., Kacker, R., Kuhn, D.R. (2013). ACTS: a combinatorial test generation tool. In Sixth IEEE international conference on software testing, verification and validation, ICST 2013, Luxembourg, Luxembourg, March 18-22, 2013 (pp. 370–375): IEEE Computer Society, DOI https://doi.org/10.1109/ICST.2013.52.
Acknowledgements
We thanks Nicolas Huin for our long discussions about column generation and how to build an efficient model.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Palmieri, A., Lallouet, A. & Pons, L. Constraint Games for stable and optimal allocation of demands in SDN. Constraints 24, 252–287 (2019). https://doi.org/10.1007/s10601-019-09303-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-019-09303-z