{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:17:45Z","timestamp":1740122265931,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:00:00Z","timestamp":1565136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:00:00Z","timestamp":1565136000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10601-019-09303-z","type":"journal-article","created":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T10:02:39Z","timestamp":1565172159000},"page":"252-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Games for stable and optimal allocation of demands in SDN"],"prefix":"10.1007","volume":"24","author":[{"given":"Anthony","family":"Palmieri","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4318-356X","authenticated-orcid":false,"given":"Arnaud","family":"Lallouet","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Pons","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,7]]},"reference":[{"issue":"1","key":"9303_CR1","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/070702370","volume":"42","author":"B Awerbuch","year":"2013","unstructured":"Awerbuch, B., Azar, Y., Epstein, A. (2013). The price of routing unsplittable flow. SIAM Journal of Computing, 42(1), 160\u2013177. \n                    https:\/\/doi.org\/10.1137\/070702370\n                    \n                  .","journal-title":"SIAM Journal of Computing"},{"key":"9303_CR2","doi-asserted-by":"publisher","unstructured":"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\u20136): IEEE Computer Society, DOI \n                    https:\/\/doi.org\/10.23919\/CNSM.2017.8256059\n                    \n                  .","DOI":"10.23919\/CNSM.2017.8256059"},{"issue":"2","key":"9303_CR3","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C Barnhart","year":"2000","unstructured":"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\u2013326. \n                    https:\/\/doi.org\/10.1287\/opre.48.2.318.12378\n                    \n                  .","journal-title":"Operations Research"},{"issue":"3","key":"9303_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"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\u2013329. \n                    https:\/\/doi.org\/10.1287\/opre.46.3.316\n                    \n                  .","journal-title":"Operations Research"},{"key":"9303_CR5","unstructured":"Bisschop, J. (2006). AIMMS optimization modeling. Lulu com."},{"issue":"4","key":"9303_CR6","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1287\/trsc.1050.0127","volume":"39","author":"D Braess","year":"2005","unstructured":"Braess, D., Nagurney, A., Wakolbinger, T. (2005). On a paradox of traffic planning. Transportation Science, 39(4), 446\u2013450. \n                    https:\/\/doi.org\/10.1287\/trsc.1050.0127\n                    \n                  .","journal-title":"Transportation Science"},{"key":"9303_CR7","doi-asserted-by":"publisher","unstructured":"Capone, A., Cascone, C., Nguyen, A.Q.T., Sanso\u0307, 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\u201332): IEEE, DOI \n                    https:\/\/doi.org\/10.1109\/DRCN.2015.7148981\n                    \n                  .","DOI":"10.1109\/DRCN.2015.7148981"},{"key":"9303_CR8","unstructured":"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\u201332): IEEE."},{"key":"9303_CR9","unstructured":"Chabert, G, & et al. (2009). Ibex An iInterval based EXplorer. \n                    http:\/\/www.ibex-lib.org\n                    \n                  ."},{"issue":"11","key":"9303_CR10","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G Chabert","year":"2009","unstructured":"Chabert, G., & Jaulin, L. (2009). Contractor programming. Artificial Intelligence, 173(11), 1079\u20131100.","journal-title":"Artificial Intelligence"},{"issue":"1\u20134","key":"9303_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/B:ANOR.0000032577.81139.84","volume":"130","author":"A Chabrier","year":"2004","unstructured":"Chabrier, A., Danna, E., Pape, C.L., Perron, L. (2004). Solving a network design problem. Annals OR, 130(1\u20134), 217\u2013239. \n                    https:\/\/doi.org\/10.1023\/B:ANOR.0000032577.81139.84\n                    \n                  .","journal-title":"Annals OR"},{"issue":"4","key":"9303_CR12","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Moses, N.E.S. (2004). Selfish routing in capacitated networks. Mathematics of Operations Research, 29(4), 961\u2013976. \n                    https:\/\/doi.org\/10.1287\/moor.1040.0098\n                    \n                  .","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"9303_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"JR Correa","year":"2007","unstructured":"Correa, J.R., Schulz, A.S., Moses, N.E.S. (2007). Fast, fair, and efficient flows in networks. Operations Research, 55(2), 215\u2013225. \n                    https:\/\/doi.org\/10.1287\/opre.1070.0383\n                    \n                  .","journal-title":"Operations Research"},{"key":"9303_CR14","unstructured":"CPLEX, I.I. (2014). 12.6 CPLEX User\u2019s Manual."},{"key":"9303_CR15","doi-asserted-by":"publisher","unstructured":"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 \u201975 (pp. 184\u2013193). Washington, DC: IEEE Computer Society, DOI \n                    https:\/\/doi.org\/10.1109\/SFCS.1975.21\n                    \n                  .","DOI":"10.1109\/SFCS.1975.21"},{"key":"9303_CR16","unstructured":"Fudenberg, D., & Tirole, J. (1991). Game theory. The MIT Press."},{"key":"9303_CR17","unstructured":"Garey, M.R., & Johnson, D.S. (1979). Computers and intractability: a guide to the theory of NP-completeness. W. H Freeman."},{"key":"9303_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1613\/jair.1683","volume":"24","author":"G Gottlob","year":"2005","unstructured":"Gottlob, G., Greco, G., Scarcello, F. (2005). Pure Nash equilibria: hard and easy games. Journal of Artificial Intelligence Research (JAIR), 24, 357\u2013406.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"9303_CR19","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11970125_19","volume-title":"Approximation and Online Algorithms","author":"Tobias Harks","year":"2007","unstructured":"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\u2013252): Springer, DOI \n                    https:\/\/doi.org\/10.1007\/11970125_19\n                    \n                  ."},{"issue":"4","key":"9303_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00446-006-0020-y","volume":"19","author":"A Hayrapetyan","year":"2007","unstructured":"Hayrapetyan, A., Tardos, \u00c9., Wexler, T. (2007). A network pricing game for selfish traffic. Distributed Computing, 19(4), 255\u2013266. \n                    https:\/\/doi.org\/10.1007\/s00446-006-0020-y\n                    \n                  .","journal-title":"Distributed Computing"},{"issue":"2-3","key":"9303_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10601-006-7094-9","volume":"11","author":"B Hnich","year":"2006","unstructured":"Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M. (2006). Constraint models for the covering test problem. Constraints, 11(2-3), 199\u2013219. \n                    https:\/\/doi.org\/10.1007\/s10601-006-7094-9\n                    \n                  .","journal-title":"Constraints"},{"issue":"3","key":"9303_CR22","doi-asserted-by":"publisher","first-page":"1320","DOI":"10.1109\/TNET.2018.2833815","volume":"26","author":"N Huin","year":"2018","unstructured":"Huin, N., Jaumard, B., Giroire, F. (2018). Optimal network service chain provisioning. IEEE\/ACM Transactions on Networking, 26(3), 1320\u20131333. \n                    http:\/\/doi.ieeecomputersociety.org\/10.1109\/TNET.2018.2833815\n                    \n                  .","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"9303_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.endm.2018.02.001","volume":"64","author":"N Huin","year":"2018","unstructured":"Huin, N., Tomassilli, A., Giroire, F., Jaumard, B. (2018). Energy-efficient service function chain provisioning. Electronic Notes in Discrete Mathematics, 64, 265\u2013274. \n                    https:\/\/doi.org\/10.1016\/j.endm.2018.02.001\n                    \n                  .","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"9303_CR24","unstructured":"IDC Forecast. (2019). The growth in connected IoT devices is expected to generate 79.4ZB of data in 2025. IDC Press release."},{"issue":"1","key":"9303_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1049\/ip-sen:19990154","volume":"146","author":"PB Key","year":"1999","unstructured":"Key, P.B., & McAuley, D. (1999). Differential qos and pricing in networks: where flow control meets game theory. IEE Proceedings - Software, 146(1), 39\u201343. \n                    https:\/\/doi.org\/10.1049\/ip-sen:19990154\n                    \n                  .","journal-title":"IEE Proceedings - Software"},{"key":"9303_CR26","unstructured":"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. \n                    http:\/\/doi.ieeecomputersociety.org\/10.1109\/ATNAC.2016.7878788\n                    \n                   (pp. 83\u201388): IEEE."},{"key":"9303_CR27","unstructured":"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:\n                    1602.01629\n                    \n                  ."},{"key":"9303_CR28","doi-asserted-by":"publisher","unstructured":"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\u2013267): Springer, DOI \n                    https:\/\/doi.org\/10.1007\/978-0-387-30165-5_10\n                    \n                  .","DOI":"10.1007\/978-0-387-30165-5_10"},{"key":"9303_CR29","unstructured":"Liu, T., Callegati, F., Cerroni, W., Contoli, C., Gabbrielli, M., Giallorenzo, S. (2018). Constraint programming for flexible service function chaining deployment. arXiv:\n                    1812.05534\n                    \n                  ."},{"issue":"2","key":"9303_CR30","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/COMST.2016.2633579","volume":"19","author":"A Mendiola","year":"2017","unstructured":"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\u2013953. \n                    https:\/\/doi.org\/10.1109\/COMST.2016.2633579\n                    \n                  .","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"2","key":"9303_CR31","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J. (1951). Non-cooperative Games. Annals of Mathematics, 54(2), 286\u2013295.","journal-title":"Annals of Mathematics"},{"key":"9303_CR32","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-10428-7_8","volume-title":"Lecture Notes in Computer Science","author":"Thi-Van-Anh Nguyen","year":"2014","unstructured":"Nguyen, T., & Lallouet, A. (2014). A complete solver for constraint games. In O\u2019Sullivan, B. (Ed.) CP 2014, Lyon, France, September 8-12, 2014. LNCS, (Vol. 8656 pp. 58\u201374): Springer, DOI \n                    https:\/\/doi.org\/10.1007\/978-3-319-10428-7_8\n                    \n                  ."},{"issue":"2","key":"9303_CR33","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1883612.1883618","volume":"43","author":"C Nie","year":"2011","unstructured":"Nie, C., & Leung, H. (2011). A survey of combinatorial testing. ACM Computing Surveys, 43(2), 11:1\u201311:29. \n                    http:\/\/doi.acm.org\/10.1145\/1883612.1883618\n                    \n                  .","journal-title":"ACM Computing Surveys"},{"key":"9303_CR34","doi-asserted-by":"publisher","unstructured":"Orda, A., Rom, R., Shimkin, N. (1993). Competitive routing in multi-user communication networks. In Proceedings IEEE INFOCOM \u201993, 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\u2013971): IEEE, DOI \n                    https:\/\/doi.org\/10.1109\/INFCOM.1993.253270\n                    \n                  .","DOI":"10.1109\/INFCOM.1993.253270"},{"key":"9303_CR35","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R. (2009). SNDlib 1.0 \u2013 survivable network design library. In Proceedings of the 3rd international network optimization conference (INOC 2007), Spa, Belgium (April 2007). \n                    http:\/\/www.zib.de\/orlowski\/Paper\/OrlowskiPioroTomaszewskiWessaely2007-SNDlib-INOC.pdf.gz\n                    \n                  , \n                    http:\/\/sndlib.zib.de\n                    \n                  , extended version accepted in Networks."},{"key":"9303_CR36","doi-asserted-by":"publisher","unstructured":"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\u2013735), DOI \n                    https:\/\/doi.org\/10.24963\/ijcai.2017\/101\n                    \n                  .","DOI":"10.24963\/ijcai.2017\/101"},{"key":"9303_CR37","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/3-540-46135-3_42","volume-title":"Lecture Notes in Computer Science","author":"Claude Le Pape","year":"2002","unstructured":"Pape, C.L., Perron, L., R\u00e9gin, 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\u2013648): Springer, DOI \n                    https:\/\/doi.org\/10.1007\/3-540-46135-3_42\n                    \n                  ."},{"key":"9303_CR38","doi-asserted-by":"publisher","unstructured":"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\u20139): IEEE, DOI \n                    https:\/\/doi.org\/10.1109\/INFOCOM.2016.7524330\n                    \n                  .","DOI":"10.1109\/INFOCOM.2016.7524330"},{"key":"9303_CR39","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-29828-8_19","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"Quang Dung Pham","year":"2012","unstructured":"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\u2013306): Springer, DOI \n                    https:\/\/doi.org\/10.1007\/978-3-642-29828-8_19\n                    \n                  ."},{"key":"9303_CR40","unstructured":"Prud\u2019homme, C., Fages, J.G., Lorca, X. (2017). Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. \n                    http:\/\/www.choco-solver.org\n                    \n                  ."},{"key":"9303_CR41","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-45471-3_35","volume-title":"Algorithm Theory \u2014 SWAT 2002","author":"Anuj Puri","year":"2002","unstructured":"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\u2013347): Springer, DOI \n                    https:\/\/doi.org\/10.1007\/3-540-45471-3_35\n                    \n                  ."},{"key":"9303_CR42","doi-asserted-by":"publisher","unstructured":"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\u2013692): IEEE, DOI \n                    https:\/\/doi.org\/10.1109\/INFOCOM.2018.8485963\n                    \n                  .","DOI":"10.1109\/INFOCOM.2018.8485963"},{"key":"9303_CR43","unstructured":"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\u201360): IEEE."},{"key":"9303_CR44","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"Philippe Refalo","year":"2004","unstructured":"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\u2013571): Springer, DOI \n                    https:\/\/doi.org\/10.1007\/978-3-540-30201-8_41\n                    \n                  ."},{"issue":"3","key":"9303_CR45","doi-asserted-by":"publisher","first-page":"520","DOI":"10.2307\/1911749","volume":"33","author":"JB Rosen","year":"1965","unstructured":"Rosen, J.B. (1965). Existence and uniqueness of equilibrium points for concave n-person games. Econometrica, 33(3), 520\u2013534.","journal-title":"Econometrica"},{"key":"9303_CR46","doi-asserted-by":"crossref","unstructured":"Roughgarden, T. (2007). Routing games, chap. 18, Algorithmic game theory (pp. 461\u2013486). Cambridge University Press.","DOI":"10.1017\/CBO9780511800481.020"},{"key":"9303_CR47","unstructured":"Sanner, J.M., Hadjadj-Aoul, Y., Ouzzif, M., Rubino, G. (2017). An evolutionary controllers\u2019 placement algorithm for reliable sdn networks. In 2017 13th international conference on network and service management (CNSM) (pp. 1\u20136): IEEE."},{"issue":"2","key":"9303_CR48","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10601-006-9006-4","volume":"12","author":"M Sellmann","year":"2007","unstructured":"Sellmann, M., Gellermann, T., Wright, R. (2007). Cost-based filtering for shorter path constraints. Constraints, 12(2), 207\u2013238. \n                    https:\/\/doi.org\/10.1007\/s10601-006-9006-4\n                    \n                  .","journal-title":"Constraints"},{"key":"9303_CR49","unstructured":"Shoham, Y., & Leyton-Brown, K. (2009). Multiagent systems - algorithmic, game-theoretic, and logical foundations. Cambridge University Press."},{"key":"9303_CR50","doi-asserted-by":"publisher","unstructured":"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\u2013423): IEEE Computer Society, DOI \n                    https:\/\/doi.org\/10.1109\/ICOIN.2016.7427148\n                    \n                  .","DOI":"10.1109\/ICOIN.2016.7427148"},{"issue":"4","key":"9303_CR51","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1109\/TCOMM.2013.020713.110882","volume":"61","author":"TH Szymanski","year":"2013","unstructured":"Szymanski, T.H. (2013). Max-flow min-cost routing in a future-internet with improved qos guarantees. IEEE Transactions on Communications, 61(4), 1485\u20131497. \n                    https:\/\/doi.org\/10.1109\/TCOMM.2013.020713.110882\n                    \n                  .","journal-title":"IEEE Transactions on Communications"},{"issue":"12","key":"9303_CR52","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.3390\/app7121265","volume":"7","author":"M Tajiki","year":"2017","unstructured":"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.","journal-title":"Applied Sciences"},{"key":"9303_CR53","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/MCOM.2017.1600939"},{"key":"9303_CR54","unstructured":"Von Neumann, J., & Morgenstern, O. (1944). Theory of games and economic behavior. Princeton University Press. \n                    http:\/\/jmvidal.cse.sc.edu\/library\/neumann44a.pdf\n                    \n                  ."},{"key":"9303_CR55","doi-asserted-by":"publisher","unstructured":"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\u2013375): IEEE Computer Society, DOI \n                    https:\/\/doi.org\/10.1109\/ICST.2013.52\n                    \n                  .","DOI":"10.1109\/ICST.2013.52"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-019-09303-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-019-09303-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-019-09303-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T23:21:29Z","timestamp":1596669689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-019-09303-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,7]]},"references-count":55,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9303"],"URL":"https:\/\/doi.org\/10.1007\/s10601-019-09303-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2019,8,7]]},"assertion":[{"value":"7 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}